FI:IA006 Automata theory - Course Information
IA006 Selected topics on automata theoryFaculty of Informatics
- Extent and Intensity
- 2/1/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Taught in person.
- prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
doc. RNDr. Jan Strejček, Ph.D. (seminar tutor)
Mgr. Miriama Jánošová (assistant)
RNDr. David Klaška (assistant)
Mgr. Juraj Major (assistant)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Supplier department: Department of Computer Science - Faculty of Informatics
- Knowlegde corresponding to the courses IB005 - Formal languages and automata and IB107 - Computability and complexity
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 256 student(s).
Current registration and enrolment status: enrolled: 0/256, only registered: 14/256, only registered with preference (fields directly associated with the programme): 3/256
- fields of study / plans the course is directly associated with
- there are 53 fields of study the course is directly associated with, display
- Course objectives
- The main aim is to understand and explain selected advanced parts of automata theory, including parsing techniques for deterministic contex-free languages, relationship between finite-state automata and MSO logic, automata on infinite words, and process specifications. Further, students should be able to make reasoned decisions about computational models appropriate for the respective areas and to understand methods and techniques of their applications.
- Learning outcomes
- At the end of the course students should be able to understand and explain selected advanced parts of automata theory, and to make reasoned decisions about computational models appropriate for the respective area and to understand methods and techniques of their applications.
- Methods of syntactic analyses of detCFLs.
- LL(k) grammars and languages, properties and analyzers.
- LR(k) grammars and languages, properties and analyzers.
- Relationships between LL, LR and detCFL.
- Infinite=state transition systems and nondeterminism - bisimulation. Selected decidable problems related to process verification.
- Finite-state automata and monadic second-order logic
- Automata and infinite words: infinite words, regular (rational) sets of infinite words.
- Automata: deterministic and nondeterministic Buchi automata, Muller, Rabin, and Street automata. McNaughton theorem. Relationships.
- CHYTIL, Michal. Automaty a gramatiky. 1. vyd. Praha: SNTL - Nakladatelství technické literatury, 1984. 331 s. info
- KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0387949070. info
- Handbook of formal languages. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997. xxiv, 873. ISBN 3540614869. info
- Handbook of formal languages. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997. xx, 625. ISBN 3540614869. info
- SIPPU, Seppo and Eljas SOISALON-SOININEN. Parsing theory : volume 2 : LR(k)and LL(k) parsing. Berlin: Springer-Verlag, 1990. 417 s. ISBN 0-387-51732-4. info
- další odkazy na studijní literaturu jsou uvedeny na webové stránce předmětu.
- Teaching methods
- Lectures, exercises, and reading. Optional homeworks.
- Assessment methods
- One midterm written exam and written final exam. Grading for the course: 25% the midterm exam, 75% the final exam. Exams are written without any reading materials (closed book).
- Language of instruction
- Follow-Up Courses
- Further Comments
- The course is taught annually.
The course is taught: every week.
- Listed among pre-requisites of other courses
- Teacher's information
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2022/IA006