Compilers (CS362 2004S)

Class 08: Finite Automata

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

Held: Friday, 6 February 2004

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, Continued. 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 May 5 11:46:58 2004.
The source to the document was last modified on Tue Jan 20 23:06:45 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2004S/Outlines/outline.08.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu