Construct deterministic and nondeterministic finite state automata (DFA and NFA) for solving simple decision problems and perform conversions from nondeterministic to deterministic finite automata as well as between regular expressions and finite state automata.

Evaluate the computational complexity of algorithms involved in the decision problems of finite state automata, use the pumping lemma to demonstrate the non-regularity of languages
Compute the minimal state machine corresponding to a DFA,
Understand and construct context-free grammars (CFG) for formal definitions involving recursion such as regular expressions ; in particular understand the fundamental role played by CFG in designing formal computer languages with simple examples
Construct (infinite state) push down automata as acceptors of context free languages ; in particular compute from CFGs the corresponding push down automaton and vice versa
Use the CFG version of the pumping lemma to prove languages that are not context free
Evaluate the computational complexity of algorithms involved in the decision problems of context free grammars and push down automaton, classify and simplify grammars into their useful canonical forms
Use deterministic push down automata to parse formal language strings (computer programs) by using (i) top down or (ii) bottom up techniques
Formulate simple language manipulation techniques using Turing Machines
In general ,learn and master the use mathematical induction techniques in proving statements on formal language and automata theory