UIN1006 Theory of Languages and Automata II

Faculty of Philosophy and Science in Opava
Winter 2013
Extent and Intensity
2/2/0. 6 credit(s). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Alice Kelemenová, CSc. (lecturer)
RNDr. Šárka Vavrečková, Ph.D. (lecturer)
RNDr. Šárka Vavrečková, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Alice Kelemenová, CSc.
Institute of Computer Science – Faculty of Philosophy and Science in Opava
Prerequisites (in Czech)
UIAI012 Fundamentals of Theoretical Computer Science I || UIAI212 Fundamentals of Theoretical Computer Science I || UIBUC56 Theory of languages and automata I || UINK115 Theory of languages and automata I || UIN1105 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
there are 7 fields of study the course is directly associated with, display
Course objectives
Basic theorems of the classical formal language theory. We put emphasis to basic algorithms and proof techniques.
Syllabus
1. Turing machine. Basic model.
2. Variants of the Turing machines.
3. Turing machines and grammars of type 0.
4. Generative power of the context-free grammars and acceptance of the pushdown automata.
5. Generative power of regular grammars and acceptance of the finite automata.
6. Chomsky hierarchy of formal languages. Typical examples.
7. Closure properties of language classes of Chomsky hierarchy with respect to union, catenation and iteration.
8. Closure properties of language classes of Chomsky hierarchy with respect to intersection.
9. Acceptation power of the pushdown automata with respect to the finite automata.
10. Acceptation power of the deterministic and nondeterministic pushdown automata
Exercises follow the content of lectures.
Literature
Harrison, M. A.: Introduction to Formal Language Theory. Addison-Wesley P. C. 1978
Rozenberg, G., Salomaa, A. Eds.: Handbook of Formal Languages. Berlin: Springer, 1997.
Wood, D.: Theory of computation. New York: John Wiley & Sons, 1987.
Teaching methods
Interactive lecture
Lecture supplemented with a discussion
Lecture with a video analysis
Assessment methods
Written exam
Language of instruction
Czech
Teacher's information
Credits from the exercises. Written exam - algorithms, oral exam - proofs of theorems.
Activity Difficulty [h]
Příprava na zápočet 12
Příprava na zkoušku 12
Summary 24
Further comments (probably available only in Czech)
The course can also be completed outside the examination period.
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 2014, Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2021, Winter 2022.
  • Enrolment Statistics (Winter 2013, recent)
  • Permalink: https://is.slu.cz/course/fpf/winter2013/UIN1006