| Course title | Theory of Automata and Formal Languages |
|---|---|
| Course code | KI/EAFJ |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Winter and summer |
| Number of ECTS credits | 7 |
| Language of instruction | English |
| Status of course | unspecified |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Course availability | The course is available to visiting students |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Finite Automata (KA): representations, languages recognizable by finite automata 2. Reduction and implementation of finite automata 3. Non-deterministic finite automata 4. Grammars: Chomsky's distribution of grammars, regular grammars 5. Regular languages: closure properties, relation to KA 6. Applications of regular languages and automata: regular expressions and their types 7. Context-free grammars 8. Pushdown automata 9. Applications of context-free languages and stack automata: LR/LL syntactic parser, ANTLR 10. Turing machines: models and their properties 11. Undecidability: the Church-Turing thesis, the Post correspondence problem 12. Equivalent representations of Turing machines: RASP 13. Practical applications
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
|
In this course, students will learn the theoretical foundations of finite automata, grammars and pushdown automata. Emphasis is placed on connecting mathematical theory with practical implementation and application of the theory to current technologies.
|
| Prerequisites |
|
unspecified
|
| Assessment methods and criteria |
|
unspecified
|
| Recommended literature |
|
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|