You should be able to translate freely between English descriptions, regular expressions, and finite state machines. Given a regular expression or a finite state machine, you should be able to tell whether a given string is in the language described or recognized by the machine. Given an English description of a language, you should be able to decided whether the language is regular.
You should be able to handle problems similar to what I just described for regular languages.
There won't be any lex or yacc questions -- those are tools, not concepts.
Last modified: Mon Oct 16 11:06:22 MDT 2006