context-free, context-sensitive, decidable, and undecidable) Understanding a hierarchy of classes of automata (finite automata, pushdown automata, and Turing machines) ...

Chomsky hierarchy grammars, pushdown acceptors and linear bounded automata. Closure properties of algorithms on grammars. Turing machine as acceptor and transducer. Universal machine. Computable and ...