| Course title | Automata and Formal Language Theory |
|---|---|
| Course code | KI/ETFI |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Winter and summer |
| Number of ECTS credits | 9 |
| 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. The Basic Mathematical Ideas. 2. Propositional Logic. 3. Sets and Relations, relational Structures, Mapping. 4. Boolean Algebra. 5. Languages and Automata, Finite Automata 6. Recognize Languages by Finite Automata 7. Reduction and Realization of Finite Automata. 8. Nondeterministic Finite Automata. 9. Regular Expressions and Languages. 10. Transcription Systems and Grammars, Chomsky hierarchy. 11. Regular Grammars and Languages. 12. Context-Free Languages. 13. Pushdown Automata.
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
| 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 |
|---|