UIN1105 Theory of languages and automata I
Faculty of Philosophy and Science in OpavaSummer 2024
The course is not taught in Summer 2024
- 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 - Prerequisites (in Czech)
- ! UIN1005 Theory of Languages and Automa || ! XX_0381 Teoretické základy informatiky
- 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
- Applied Mathematics (programme MU, B1101)
- Applied Mathematics in Risk Management (programme MU, B1101)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Mathematical Methods in Economics (programme MU, B1101)
- Mathematics (programme MU, B1101)
- 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. Finite automata.
- 4. Closure properties of regular languages.
- 5. Regular grammars and their relation to finite automata.
- 6. Chomsky hierarchy of languages.
- 7. Context-free grammars, their variations and properties.
- 8. Pushdown automata.
- Literature
- required literature
- CIENCIALOVÁ, Lucie. Teoretické základy informatiky. Opava: Slezská univerzita v Opavě, 2014. ISBN 978-80-7510-130-3. info
- VAVREČKOVÁ, Šárka. Teorie jazyků a automatů I. Opava: Slezská univerzita v Opavě, 2017.
- recommended literature
- LINZ, Peter. An introduction to formal languages and automata. Sixth edition. Burlington, MA: Jones, 2017. ISBN 978-1-284-07724-7. info
- MEDUNA, Alexander and Petr ZEMEK. Regulated grammars and automata. New York: Springer, 2014. ISBN 978-1-4939-0368-9. info
- Hopcroft, J. E., Motwani, R., Ullman, J. D. Introduction to Automata Theory, Languages and Computation. Upper Saddle River: Pearson Education Inc.,, 2003. info
- ČERNÁ, I, M KŘETÍNSKÝ and A KUČERA. Automaty a formální jazyky I. Brno: FI MU, 2002. info
- MEDUNA, A. Automata and Languages: Theory and Applications. Springer, London, 2000. info
- 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
- Further comments (probably available only in Czech)
- Study Materials
The course can also be completed outside the examination period.
- Enrolment Statistics (Summer 2024, recent)
- Permalink: https://is.slu.cz/course/fpf/summer2024/UIN1105