CS362 2011F Compilers

Class 08: Finite Automata

Back to Regular Expressions. On to From Specification to Optimal DFA (1).

This outline is also available in PDF.

Held: Monday, 12 September 2011

Summary: Today we consider finite automata, which serve as another, more computational, representation of data for lexical analysis.

Related Pages:

Notes:

Overview:

Finite Automata

Some Examples

Nondeterministic Finite Automata

Looking Ahead

Back to Regular Expressions. On to From Specification to Optimal DFA (1).

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 7 10:26:32 2011.
The source to the document was last modified on Fri Aug 26 13:03:12 2011.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2011F/Outlines/outline.08.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu