FPF:UIIABP0046 TLA I - Course Information
UIIABP0046 Theory of languages and automata I
Faculty of Philosophy and Science in OpavaSummer 2025
- Extent and Intensity
- 2/2/0. 6 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
doc. RNDr. Lucie Ciencialová, Ph.D. (seminar tutor)
RNDr. Radka Poláková, Ph.D. (seminar tutor) - Guaranteed by
- doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Computer science and English (programme FPF, In-An-bp)
- Course objectives
- The objective of the course is to introduce to theory of informatics, especially to theory of formal languages. We deal with finite automata, regular expressions and simple formal grammars. The presented structures can be used for various purposes such as modelling and simulation in programming.
- Learning outcomes
- Students will be able to: - define important concepts of theoretical computer science - using abstract computational models - apply the acquired knowledge on concrete examples.
- Syllabus
- 1. Alphabet, formal languages, operations with formal languages.
- 2. Regular languages, regular expressions.
- 3.-5. Finite automata.
- 6. Closure properties of regular languages.
- 7.-8. Criteria for regularity of a language.
- 9. Chomsky's hierarchy of languages.
- 10.-11. Regular grammars and their relation to finite automata.
- 12.-13. Context-free grammars, their variants and properties.
- Teaching methods
- Interactive lecture
Lecture supplemented with a discussion - Assessment methods
- Credit: two tests, attendance at seminars min. 75%. Exam: written and oral part
- Language of instruction
- Czech
- Enrolment Statistics (Summer 2025, recent)
- Permalink: https://is.slu.cz/course/fpf/summer2025/UIIABP0046