Information System of Masaryk University 

Course Information

IA006 Selected topics on automata theory

Faculty of Informatics
Autumn 2002

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

prof. RNDr. Mojmír Křetínský, CSc. (lecturer), prof. RNDr. Ivana Černá, CSc. (deputy)
prof. RNDr. Ivana Černá, CSc. (seminar tutor)
doc. RNDr. Jiří Barnat, Ph.D. (seminar tutor), prof. RNDr. Ivana Černá, CSc. (deputy)
RNDr. Vojtěch Řehák, Ph.D. (seminar tutor), prof. RNDr. Ivana Černá, CSc. (deputy)

Supervisor

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.

Timetable

Wed 15:00–17:50 D2

• Timetable of Seminar Groups:

IA006/01 each odd Thursday 14:00–15:50 B003, J. Barnat
IA006/02 each even Thursday 14:00–15:50 B003, J. Barnat
IA006/03 each odd Friday 8:00–9:50 B011, V. Řehák
IA006/04 each even Friday 8:00–9:50 B011, V. Řehák
IA006/Nza1p M. Křetínský

Prerequisites

! I006 Automata II
Knowlegde corresponding to the course IB005 - Formal languages and automata and IB107 - Computability and complexity

Course Enrollment Limitations

The course is only offered to the students of the study fields the course is directly associated with.

Fields of study the course is directly associated with

there are 6 fields of study the course is directly associated with, display

Course objectives

The purpose of this course is to introduce computer science students to advanced parts of automata theory (including infinite words, bisimulations,...) and to understand methods of their applications.

Syllabus

• 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.
• Transition systems and nondeterminism - bisimulation. Selected decidable problems related to process verification.
• 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.

Literature

• Handbook of formal languages. Vol. 2, Linear modeling : background and application. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997. xv, 528 s. ISBN 3-540-60648-3-. info
• Handbook of formal languages. Vol. 3, Beyond words. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997. xiv, 625 s. ISBN 3-540-60649-1-. info
• KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0-387-94907-0. 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
• CHYTIL, Michal. Automaty a gramatiky. 1. vyd. Praha: SNTL - Nakladatelství technické literatury, 1984. 331 s. info

Assessment methods (in Czech)

Během semestru jedna pisemná zkouška. Závěrečná zkouška je rovněž písemná; obě bez použití materiálů.

Follow-Up Courses

• IA040 Modal and Temporal Logics for Processes
• IA041 Concurrency Theory
• PA008 Compiler Construction

Further Comments

The course is taught annually.

Listed among pre-requisites of other courses

• IA041 Concurrency Theory
  IA006  
• IA159 Formal Verification Methods
  IA006  

Teacher's information

http://www.fi.muni.cz/usr/kretinsky/fja2.html

The course is also listed under the following terms Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013.

---

• Enrollment Statistics (Autumn 2002, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2002/IA006

---