CSE322 | ||||
4 | ||||
The course gives an overview over basic formal grammars and abstract machine models used in Computer Science. In particular, finite automata, pushdown automata, context-free grammars and Turing machines are studied with respect to their properties and limits. Based on Turing machines the concepts of decidability and recursive enumerability are introduced. | ||||
| ||||
Winter |
Astrid kiehn |
Astrid kiehn |