|School of Computing|
Check my WWW page for up to date information, you are welcome to send me e-mail at email@example.com.
Lectures are from noon to 12:50am Mondays, Wednesday, and Fridays in the Crawford Building, room 402.
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, or ECE 2552, ECE 3541.
Mathematical sophistication is required.
The textbook for the class is:
Introduction to Formal Languages, and Automata, sixth edition.
Sudbury, Massachusetts: Jones \& Bartlett, 2017.
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman.
Introduction to Automata Theory, Languages, and Computation, third edition.
Boston, Massachusetts: Peason/Addison Wesley, 2007.
Dexter Campbell Kozen.
Automata Theory and Computability.
New York: Springer, 1997.
Michael A. Harrison.
Introduction to Formal Language Theory.
Thomas A. Sudkamp.
Languages and Machines: An introduction to the Theory of Computer Science.
Boston, Massachusetts: Pearson/Addison-Wesley Education, 2006.
Formal Languages and Automata Theory.
New York, New York: Computer Scence Press, 1989.
Students are expected to do all the Gradiance homework. There will be one midterm and one final. For each student the numeric scores for the assignments and exams are recorded.
|Monday, 9 Jan 2017||first lecture|
|Monday, 16 January 2017||MLK day, no classes|
|Monday, 16 January 2017||HW #1 due|
|Friday, 27 January 2017||HW #2 due|
|Friday, 3 February 2017||HW #3 due|
|Monday, 6 February 2017||HW #4 due|
|Monday, 20 February 2017||Presidents' day, no classes|
|Friday, 24 February 2017||mid-term exam
|Tuesday, 2 May 2017||1-3pm, final exam|
Reading assignment. Linz, Chapter 1: Preliminaries Reading assignment. HMU, Chapter 1: Preliminaries
Reading assignment. HMU, Chapter 2 and Chapter 3
Reading assignment. HMU, Chapter 4
Reading assignment. HMU, Chapter 5
Reading assignment. HMU, Chapter 6
Reading assignment. HMU, Chapter 7
Reading assignment. HMU, Chapter 8
Reading assignment. HMU, Chapter 9