Compilers (CSC-362 98F)


Class 6: Introduction to finite automata

Held Wednesday, September 9, 1998

Notes

Context

Describing tokens with regular expressions

Finite automata

Nondeterministic finite automata

From regular expression to DFA

Back to Introduction to lexical analysis and regular expressions. On to From regular expression to finite automaton.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

Source text last modified Fri Sep 11 12:28:17 1998.

This page generated on Wed Sep 16 11:21:17 1998 by SiteWeaver.

Contact our webmaster at rebelsky@math.grin.edu