Logo ČVUT
ČESKÉ VYSOKÉ UČENÍ TECHNICKÉ V PRAZE
STUDIJNÍ PLÁNY
2019/2020

Automata and Grammars

Přihlášení do KOSu pro zápis předmětu Zobrazit rozvrh
Kód Zakončení Kredity Rozsah Jazyk výuky
BIE-AAG Z,ZK 6 2P+2C
Přednášející:
Jan Holub (gar.), Jan Trávníček
Cvičící:
Tomáš Pecka, Jan Trávníček
Předmět zajišťuje:
katedra teoretické informatiky
Anotace:

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.

Požadavky:

Knowledge of basic data structures and computer programming.

Osnova přednášek:

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. Classes P, NP, NPC, NPH

Osnova cvičení:

1. Implementation of FA.

2. Examples of formal languages. Intuitive considerations of grammars for given languages. Estimation of the classification of a given language in Chomsky hierarchy.

3. Intuitive creation of finite automata (DFA, NFA, with epsilon transitions) for a given langauage.

4. Transformations and compositions of FA.

5. FA with output function and its implementation.

6. Conversions of grammars to FA and vice versa.

7. Considerations, modifications and transformations of regular expressions.

8. Use of regular expressions for text processing tasks (e.g. sh, grep, sed, perl).

9. Creation and implementation of lexical analyzers.

10. Classification of languages.

11. Examples of context-free languages, creation of pushdown automata.

12. Examples of deterministic parsing of context-free languages (e.g. LL, yacc, bison).

13. Examples of context-sensitive and recursively enumerable languages, creation of grammars, creation of Turing machines.

Cíle studia:

The module introduces students to finite automata, regular expressions, grammars, and translation finite automata, with an emphasis on their practical use. Furthermore, the module introduces students to the class of context-free languages, basic use of pushdown automata, as well as the classification of languages.

Studijní materiály:

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

2. Kozen, D. C. ''Automata and Computability''. Springer, 1997. ISBN 0387949070.

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

Poznámka:

Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BIE-AAG/Rozsah=prednasky+proseminare+cviceni2p+2c

Další informace:
https://courses.fit.cvut.cz/BIE-AAG/
Rozvrh na zimní semestr 2019/2020:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Po
Út
místnost TH:A-s135
Holub J.
Trávníček J.

09:15–10:45
(přednášková par. 1)
Thákurova 7 (FSv-budova A)
As135
St
Čt
místnost T9:302
Trávníček J.
12:45–14:15
(přednášková par. 1
paralelka 101)

Dejvice
NBFIT učebna
místnost T9:302
Trávníček J.
14:30–16:00
(přednášková par. 1
paralelka 102)

Dejvice
NBFIT učebna

Rozvrh na letní semestr 2019/2020:
Rozvrh není připraven
Předmět je součástí následujících studijních plánů:
Platnost dat k 23. 9. 2019
Aktualizace výše uvedených informací naleznete na adrese http://bilakniha.cvut.cz/cs/predmet1450406.html