SubjectsSubjects(version: 953)
Course, academic year 2019/2020
Automata and Grammars - N500009
Title: Automaty a gramatiky
Guaranteed by: CTU in Prague, Faculty of Information Technology (500)
Faculty: University of Chemistry and Technology, Prague
Actual: from 2013 to 2020
Semester: winter
Points: winter s.:6
E-Credits: winter s.:6
Examination process: winter s.:
Hours per week, examination: winter s.:2/2, C+Ex [HT]
Capacity: unknown / unknown (unknown)
Min. number of students: unlimited
State of the course: taught
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Guarantor: Holub Jan prof. Ing. Ph.D.
Is interchangeable with: B500005
Examination dates   Schedule   
Annotation -
Students are introduced to basic theoretical and implementation principles of the following topics: construction, use and mutual transformations of finite automata, regular expressions and regular grammars, translation finite automata, construction and use of pushdown automata, hierarchy of formal languages, Relationships between formal languages and automata. Knowledge acquired through the module is applicable in designs of algorithms for searching in text, data compression, simple parsing and translation, and design of digital circuits.
Last update: Jirát Jiří (09.01.2014)
Aim of the course -

Students will be able to:

Understand finite automata, regular expressions, grammars, and translation finite automata, with an emphasis on their practical use.

Understand the class of context-free languages, basic use of pushdown automata, as well as the classification of languages.

Last update: Jirát Jiří (31.01.2014)
Literature -

R:Aho, A. V., Lam, M. S., Sethi, R., Ullman, J. D. "Compilers: Principles, Techniques, and Tools" (2nd Edition). Addison Wesley, 2007. ISBN 0321486811.

R:Kozen, D. C. "Automata and Computability". Springer, 1997. ISBN 0387949070.

R:Melichar, B., Holub, J., Mužátko, P. "Languages and Translations". Praha: Publishing House of CTU, 1997. ISBN 80-01-01692-7.

Last update: Jirát Jiří (09.01.2014)
Learning resources -

(login necessary)

Last update: Jirát Jiří (09.01.2014)
Syllabus -

1. Motivation to study formal languages. Basic notions (language, alphabet, grammar, automaton), Chomsky hierarchy.

2. Nondeterministic and deterministic finite automata (NFA, DFA), NFA with epsilon transitions.

3. Operations on automata (transformation to NFA without epsilon transitions, to DFA, minimization), intersection, union.

4. Programming implementations of DFA and NFA, circuit implementations.

5. Adding translation, Mealey, Moore, conversions.

6. Operations on regular grammars, conversions to FA.

7. Regular expressions, regular expression conversions, finite automata and regular grammars, Kleene theorem.

8. Principles of use of regular expressions in UNIX (grep, egrep, perl, PHP, ...).

9. Finite automaton as a lexical analyzer, lex/flex generators.

10. Properties of regular languages (pumping lemma, Nerode theorem).

11. Context-free languages, pushdown automaton.

12. Parsing of context-free languages (nondeterministic versus deterministic).

13. Context-sensitive and recursively enumerable languages, Turing machine.

Last update: Jirát Jiří (09.01.2014)
Registration requirements -

Knowledge of basic data structures and computer programming.

Last update: Jirát Jiří (09.01.2014)
Teaching methods
Activity Credits Hours
Účast na přednáškách 1 28
Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi 0.5 14
Práce na individuálním projektu 2 56
Příprava na zkoušku a její absolvování 1.1 30
Účast na seminářích 1 28
6 / 6 156 / 168