Check my WWW page for up to date information, you are always welcome to send me email.
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, contextfree 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:
Linz 
Peter Linz. Introduction to Formal Languages, and Automata, sixth edition. Sudbury, Massachusetts: Jones & Bartlett, 2017. ISBN13: 9781284077247 
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.
Hopcroft 
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation, third edition. Boston, Massachusetts: Pearson/Addison Wesley, 2007. ISBN13: 9780321455363 
Kozen  Dexter Campbell Kozen. Automata Theory and Computability. New York: Springer, 1997. ISBN: 9781461273097. DOI 10.1007/9781461218449 

Harrison  Michael A. Harrison. Introduction to Formal Language Theory. 1978. 

Sudkamp  Thomas A. Sudkamp. Languages and Machines: An introduction to the Theory of Computer Science, third edition. Boston, Massachusetts: Pearson/AddisonWesley Education, 2006. ISBN: 9780321322210. 

Floyd 
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 ISBN: 9780716782667. 

Goddard 
Wayne Goddard. Introducing the Theory of Computation. DOI ISBN: 9780763741256. Sudbury, Massachusetts: Jones & Bartlett, 2008. 

Singh 
Arindama Singh. Elements of Computation Theory. DOI ISBN: 9781848824973. London: Springer, 2009. 
math  automata  grammar  expressions  properties  

Introduction  1.1  1.2  
Regular  2  3.3  3.1, 3.2  4  
ContextFree  7  5, 6  algebra  8  
ContextSensitive  10.5  11.3  
Recursive enumerable  9, 10  11.2  λ  
Chapter 13: Other Models of Computation  
Chapter 14: An Overview of Complexity Theory 
math  automata  grammar  expressions  properties  

Introduction  1  
Regular  2  Ex 5.1.4  3  4  
ContextFree  6  5  algebra  7  
ContextSensitive  LBA  CSG  
Recursive enumerable  8  λ  
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 crosslisted 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:0016:00 EDT) 
Friday, 23 September 2022  Midterm Exam #1 Chapters 1,2,3,4 
1011 October 2022  Fall Break (no classes) 
Tuesday, 11 October 2022  Ada Lovelace Day 
Saturday, 15 Oct 2022  Google Kickstart, Round G (08:0011: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:0001:00 EST) 
2325 November 2022  Thanksgiving (no classes) 
Saturday, 3 December 2022  MakeUp Lecture 
Friday, 9 December 2022  Last lecture 
Tuesday, 13 December 2022  Final Exam, 13pm 