|
||||
| Description: | ||||
| Languages, the grammars that generate them and the machines that accept them. Regular languages. Finite automata- deterministic and nondeterministic. Transition functions and state diagrams. Context-free languages and pushdown automata. Context-free grammars and compiler design. Context-sensitive languages and linear-bounded automata. Closure results. | ||||
|