|
Lecturer(s)
|
-
Kolář Milan, doc. Ing. CSc.
|
|
Course content
|
The subject is oriented as an introduction of the automata theory, grammars and special chosen parts of algorithm theory. The consequence of this subject is that knowledges of students are united into one whole.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
The aim of this subject is to introduce students into theory of automata and formal languages in measure that is necessary for understanding of modern monographs and articles of the theoretical and practical informatics or programming. The subject is suitable for students that are not trained mathematicians.
Students will obtain the ability to design, to simplify and to adjust arbitrary finite automata with efficiency to verify the accuracy of schemes. Further he will be able to design and verify various types of grammars and make syntactic analysis.
|
|
Prerequisites
|
Condition of registration: not any.
|
|
Assessment methods and criteria
|
Combined examination
|
|
Recommended literature
|
-
Ginzburg, A. Algebraic Theory of Automata. Academic Press, London, 1968.
-
Hopcroft, J.E. - Ullman, J.D. Formálne jazyky a automaty. Bratislava, Alfa 1978. (Překlad z angličtiny.).
-
Chytil, M. Automaty a gramatiky. Praha, SNTL 1984.
-
Mareš, J. Jazyky, gramatiky a automaty. Praha. Vydavatelství ČVUT, 2004.
-
Melichar, B. Jazyky a překlady. Praha. Vydavatelství ČVUT, 2003.
-
Pin, J.E. Mathematical Foundations of Automata Theory. 2014.
|