UIN1006 Theory of Languages and Automata II

Faculty of Philosophy and Science in Opava
Winter 2022
Extent and Intensity
2/2/0. 6 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
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
Timetable
Tue 16:25–18:00 B2
  • Timetable of Seminar Groups:
UIN1006/A: Wed 13:05–14:40 B2, R. Poláková
Prerequisites
! UINK106 TLA II
The topics require some preliminary knowledge, so it is necessary for each student to familiarize themselves with the content of the course Theory of Languages and Automata I.
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
Course objectives
Basic theorems of the classical formal language theory. We put emphasis to basic algorithms and proof techniques.
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. Revision - finite automata and regular grammars. Language regularity criteria.
  • 2. Transformation of context-free grammars. Context-free criteria.
  • 3. Pushdown automata, variants, types of acceptance.
  • 4. Closing properties of context-free languages.
  • 5. Deterministic context-free languages.
  • 6. Grammars of type 0, Turing machines.
  • 7. Grammars of type 1, Linear bounded automata.
  • 8. Grammars and grammar systems not corresponding to the Chomsky hierarchy.
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ů II. Opava: Slezská univerzita v Opavě, 2017.
    recommended literature
  • MEDUNA, A. Automata and Languages: Theory and Applications. Springer, London, 2000. info
  • ČERNÁ, I, M KŘETÍNSKÝ and A KUČERA. Automaty a formální jazyky I. Brno: FI MU, 2002. info
  • DEMLOVÁ, M. - KOUBEK, V. Algebraická teorie automatů. Praha: SNTL, 1990. info
  • CHYTIL, M. Automaty a gramatiky. Praha: SNTL, 1984. info
  • GRUSKA, J. Foundations of Computing. London: International Thomson Computer Press, 1997. info
  • MOLNÁR, Ľ. ČEŠKA, M. , MELICHAR, B. Gramatiky a jazyky. Bratislava: ALFA, 1987. info
  • MEDUNA, A. MEDUNA, A. Gramatiky, automaty a kompilátory. Brno: VUT, 1987. info
  • Hopcroft, J. E., Motwani, R., Ullman, J. D. Introduction to Automata Theory, Languages and Computation. Upper Saddle River: Pearson Education Inc.,, 2003. info
Teaching methods
Interactive lecture
Lecture supplemented with a discussion
Tutorials
Assessment methods
Credit: two tests, attendance at seminars min. 75%. Exam: written and oral part, list of possible questions on the teacher's website
Language of instruction
Czech
Further comments (probably available only in Czech)
Study Materials
The course can also be completed outside the examination period.
Teacher's information
Aktivity Náročnost [h]
Cvičení 20
Konzultace 5
Přednáška 20
Příprava na zápočet 20
Příprava na zkoušku 20
Celkem 85
The course is also listed under the following terms Winter 1993, Winter 1994, Winter 1995, Winter 1996, Winter 1997, Winter 1998, Winter 1999, Winter 2003, Winter 2004, Winter 2005, Winter 2006, Winter 2007, Winter 2008, Winter 2009, Winter 2010, Winter 2011, Winter 2012, Winter 2013, Winter 2014, Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2021.
  • Enrolment Statistics (recent)
  • Permalink: https://is.slu.cz/course/fpf/winter2022/UIN1006