| Course title | Formal Language Theory |
|---|---|
| Course code | KI/TFL |
| Organizational form of instruction | Lecture + Seminary |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Summer |
| Number of ECTS credits | 5 |
| Language of instruction | Czech |
| Status of course | unspecified |
| Form of instruction | unspecified |
| Work placements | unspecified |
| Recommended optional programme components | None |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Transkriptive Systems 2. Grammars. 3. Chomsky hierarchy. 4. Regular Grammars and Languages. 5. Reduced. Grammars. 6. Canonical derivatives. 7. Pushdown Automata. 8. Pushdown Automata and Context-Free Languages. 9. The basic methods of Syntactic Analysis. 10. Turing Machines. 11. Algorithmically Unsolvable Problems. 12. RASP Machines.
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
|
Formal language theory defines a language as a set of strings. What is then studied are the ways in which a languages may be generated (or accepted), as well as the relationships between these mechanisms (for example, whether the class of languages that can be described using regular expressions are the same as the class of languages that can be described using finite state automata).
|
| 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 |
|---|