Check my WWW page for up to date information, you are always welcome to send me e-mail.
Lectures are from 1pm to 1:50pm Mondays, Wednesday, and Fridays in CRF, room 230.
CSE 4083 Formal Languages and Automata Theory. Presents abstract models of computers (finite automata, pushdown automata and Turing machines) and the language classes they recognize or generate (regular, context-free and recursively enumerable). Also presents applications of these models to compiler design, algorithms and complexity theory. Prerequisite: CSE 2010.
Mathematical sophistication is required, in particular discrete math. There will be no programming projects.
The textbook for the class is:
Introduction to Formal Languages, and Automata, sixth edition.
Sudbury, Massachusetts: Jones & Bartlett, 2017.
Other books are similar and cover the same material. In particular the book by Hopcroft, Motwani, and Ullman (HMU) is very similar, and sometimes used as the textbook in this course.
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman.
Introduction to Automata Theory, Languages, and Computation, third edition.
Boston, Massachusetts: Pearson/Addison Wesley, 2007.
|Kozen||Dexter Campbell Kozen.
Automata Theory and Computability.
New York: Springer, 1997.
|Harrison||Michael A. Harrison.
Introduction to Formal Language Theory.
|Sudkamp||Thomas A. Sudkamp.
Languages and Machines: An introduction to the Theory of Computer Science, third edition.
Boston, Massachusetts: Pearson/Addison-Wesley Education, 2006.
Robert W. Floyd and Richard Beigel.
The Language of Machines: An introduction to the Computability and Formal Languages, ? edition.
New York: New York: Computer Science Press, 1994
Introducing the Theory of Computation.
DOI ISBN: 9780763741256.
Sudbury, Massachusetts: Jones & Bartlett, 2008.
Elements of Computation Theory.
DOI ISBN: 978-1-84882-497-3.
London: Springer, 2009.
|Recursive enumerable||9, 10||11.2||λ|
|Chapter 13: Other Models of Computation|
|Chapter 14: An Overview of Complexity Theory|
|Chapter 10: Intractable Problems|
|Chapter 11: Additional Classes of Problems|
I think the ones by Busch are the best and I have provided Panopto recordings. Ullman's follows his own book, of course, and so are not focused on the way this class is organized. Linz' notes are not as extensive at Busch's. Each grid is cross-listed with Wikipedia articles which are often quite good on these topics.
|Monday, 22 August 2022||First lecture|
|Monday, 5 September 2022||Labor Day (no classes)|
|Sunday, 18 September 2022||Google Kickstart, Round F (13:00-16:00 EDT)|
|Friday, 23 September 2022||Midterm Exam #1
|10-11 October 2022||Fall Break (no classes)|
|Tuesday, 11 October 2022||Ada Lovelace Day|
|Saturday, 15 Oct 2022||Google Kickstart, Round G (08:00-11:00 EDT)|
|Sunday, 6 November 2022||Daylight Savings Time ends|
|Fri, 4 November 2022||Midterm Exam #2
Chapters 5, 6, 7, 8
|Friday, 11 November 2022||Vetrans Day (no classes)|
|Friday, 11 November 2022||Google Kickstart, Round H (22:00-01:00 EST)|
|23-25 November 2022||Thanksgiving (no classes)|
|Saturday, 3 December 2022||Make-Up Lecture|
|Friday, 9 December 2022||Last lecture|
|Tuesday, 13 December 2022||Final Exam, 1-3pm