1. Formal Languages and Automata Theory
Cpt S 317: Automata & Formal Languages
Formal Languages and Automata Theory
Academic Year
Department of Informatics
Faculty of Mathematics and Informatics
West University of Timisoara
The structure and the content of the lecture is based on edu/~ananth/CptS317/Lectures/index.htm
School of EECS, WSU

2. Cpt S 317: Automata & Formal Languages
Instructor Contacts
Instructor:
Madalina Erascu
Room F109
Webpage:
Weekly Office Hours: Wednesdays 4 - 7:30 PM
School of EECS, WSU

3. Cpt S 317: Automata & Formal Languages
Objectives
Introduce concepts in automata theory and theory of computation
Identify different formal language classes and their relationships
Design grammars and recognizers for different formal languages
Prove or disprove theorems in automata theory using its properties
Determine the decidability and intractability of computational problems
School of EECS, WSU

4. Cpt S 317: Automata & Formal Languages
Course Organization
Very broadly, the course will contain three parts:
Part I) Regular languages
Part II) Context-free languages
Part III) Turing machines & decidability
School of EECS, WSU

5. Cpt S 317: Automata & Formal Languages
Seminar
TA1
Madalina Erascu
TA2: 
Alexandra Fortis
Office hours: Mondays 11:20 AM – 12:50 PM
School of EECS, WSU

6. Cpt S 317: Automata & Formal Languages
Prerequisites
No course work prerequisites
Basic math knowledge, problem solving, programming skills
School of EECS, WSU

7. Cpt S 317: Automata & Formal Languages
Required Textbook
Introduction to Automata Theory, Languages and Computation
By J.E. Hopcroft, R. Motwani, J.D. Ullman
2rd Edition
Addison Wesley/Pearson
I have an electronic copy!
Limbaje Formale
By Mircea Dragan, stefan Maruster
Eubeea
You can find it at university library
School of EECS, WSU

8. Cpt S 317: Automata & Formal Languages
Course Webpage
Why do I need to check the webpage?
Lecture Notes
Homeworks will be posted on the webpage
A tentative schedule will also be posted and maintained
Misc. static information about the course
How frequently do I need to keep checking the course webpage?
Once in a week
School of EECS, WSU

9. How to get in touch with the instructor and the TA(s)?
Cpt S 317: Automata & Formal Languages
How to get in touch with the instructor and the TA(s)?
Office hours
Weekly once
preferred way to meet one-on-one
By appointment
School of EECS, WSU

10. Attendance Course: no mandatory attendance
Lab/Seminar: no mandatory attendance

11. Cpt S 317: Automata & Formal Languages
Grading
Homeworks (30%)
2 midterms (20% + 20%)
1 final (30%)
Projects, not mandatory (20%)
School of EECS, WSU

12. Homework Submission Policy
Cpt S 317: Automata & Formal Languages
Homework Submission Policy
Hardcopy to be brought in class when the lab/seminar takes place
No late submissions
Homeworks will be posted on the course website
School of EECS, WSU

13. Cpt S 317: Automata & Formal Languages
Homework Policy
All homework must be done individually
Cheating:
Helping others, getting help, looking up website for solutions, etc.
Any deviation from the above rule will be considered cheating and will be subject to punishment
School of EECS, WSU

14. Cpt S 317: Automata & Formal Languages
Exam Policy
2 Midterms and 1 Final
Closed book, closed notes, comprehensive
School of EECS, WSU

15. Course Schedule - Tentative
Cpt S 317: Automata & Formal Languages
Course Schedule - Tentative
C1. (2h) Course overview. Introduction to Automata Theory & Formal Languages
C2. (2h) Finite Automata
C3. (2h) Regular Expressions
C4. (2h) Regular Language Properties
C5. (2h) Midterm I
C6. (2h) Context Free Grammars and Languages
C7. (2h) Pushdown Automata
C8-9. (4h) Context-Free Language Properties
C10. (2h) Midterm II
C11. (2h) Turing Machines
C12-C13. (4h) Undecidability
C14. (2h) Course & Finals Review
School of EECS, WSU

16. Cpt S 317: Automata & Formal Languages
Lecture basics
Classes will involve both Slides + Board
Lecture slides available online
However, no scribes from class will be made available
So, take your own notes in class
For latest/updated slides, download before each use
School of EECS, WSU