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 ...

Formalization of the notion of problems via formal languages Formalization of the notion of computation using "abstract computing devices" called automata Understanding a hierarchy of classes of ...