Title: CS 4384: Automata Theory
Course Registration Number: 3491
Times: MW 2:30-3:45
Location: ECSS 2.412
Instructor: Dr. Kevin Hamlen (hamlen AT utdallas)
Instructor's Office Hours: Thur 3:30-5:30 in ECSS 3.704
Teaching Assistant: Micah Jones (micah.jones1 AT student.utdallas)
TA's Office Hours: F 12:00-2:00 in ECSS 3.613
This course covers foundational theory and practice of finite state machines, regular expression matching, and context-free grammars. The following are the course learning objectives:
Through taking this course, students will learn the theoretical and practical significance of automata theory and its application to important real-world problem domains, such as parsing, programming language design, security policy specification, natural language processing, and many others. The material will also be linked to important theoretical foundations of computer science, such as complexity theory.
The course is open to undergraduates and must be taken for letter grade only.
Prerequisites: CS 3305 Discrete Math for Computing II
Homework (30%): There will be 6 homework assignments assigned at a rate of approximately one assignment every 2 weeks. Problems will consist of discrete math and proofs. There may also be some programming problems to be completed in the language of your choice. Homeworks must be turned on Friday the week that they are due. No late homeworks will be accepted.
Quizzes (15%): Pop quizzes will be administered at the start of class on randomly chosen dates. The quizzes will typically be very short, consisting of about 5 multiple-choice or short-answer questions, and are intended to help the student stay current with the material presented in lectures.
Midterm (20%): A midterm exam will be administered in class on Monday, October 11. It will cover all material up to that date, including DFA's, NFA's, regular expressions, regular closure properties, regular emptiness, finiteness, and equivalence decision algorithms.
Final (35%): The final exam for the course is scheduled for Monday, December 13th at 2:00pm. The exam will be cumulative, covering all material in the course. Students will have 2 hours and 45 minutes to complete it.
Students may work individually or together with other students presently enrolled in the class to complete the assignments, but they must CITE ALL COLLABORATORS AND ANY OTHER SOURCES OF MATERIAL that they consulted, even if those sources weren't copied word-for-word. Copying or paraphrasing someone else's work without citing it is plagiarism, and may result in severe penalties such as an immediate failing grade for the course and/or expulsion from the computer science program. Therefore, please cite all sources!
Students may NOT collaborate with students who are not currently enrolled in the class. In particular, it is a violation of the class homework policy to collaborate with a student who took the class in a previous semester or to consult their old homework solutions. These sources are off-limits because such "collaborations" tend to involve simply copying or paraphrasing someone else's answer to a similar homework problem, which does not show that you have learned the material yourself and does not prepare you for the exams.
The course will loosely follow the following textbook:
Purchase of the text is encouraged but not required. Lectures and homework assignments will be self-contained, so will not require explicit access to the textbook. The text has also been placed on reserve in the McDermott Library.
In addition, homework 4 requires students to learn the basics of the Unix programs flex and bison. The following eBook is a good resource and is available through the McDermott Library. You will need to login using your UTD ID number.
|Course Introduction: Deterministic Finite Automata (DFA's)|
|Non-deterministic Automata: NFA's and Regular Expressions||Assignment 1 due
|Labor Day (university closed)|
|Properties of Regular Languages|
|Proving non-regularity: Pumping Lemma||Assignment 2 due
|Proving regularity: Closure properties|
|Regular Decision Problems: Emptiness, Finiteness|
|Regular Decision Problems: Language equivalence|
|DFA Minimization||Assignment 3 due
|CFG's: Derivation Trees|
|CFG's: Proving correctness of CFG's|
|Midterm Debriefing: Prep for the Final Exam||Assignment 4 due
|Chomsky Normal Form|
|Proving non-context-freedom: Pumping Lemma for CFL's|
|Class Canceled||Assignment 5 due
|Properties of Context-free Languages|
|Closure Properties of CFL's|
|CFL Decision Algorithms: Emptiness and finiteness|
|CFL Decision Algorithms: Membership||Assignment 6 due
|Decidability and Undecidability|
|P vs. NP|
|Class Canceled (Thanksgiving break)|
|Security Automata and In-lined Reference Monitors