A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
BIK-AAG Automata and Grammars Extent of teaching: 13KP+4KC Instructor: Completion: Z,ZK Department: 18101 Credits: 6 Semester: Z 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. Knowledge acquired through the module is applicable to creation of algorithms for pattern matching, data compression, translation, simple parsing, and creation of digital circuits.
Lecture syllabus:
1. Motivation to study formal languages. Basic notions (language, alphabet, grammar, automaton), Chomsky hierarchy. Nondeterministic and deterministic finite automata (NFA, DFA), NFA with epsilon transitions. 2. Operations on automata (transformation to NFA without epsilon transitions, to DFA, minimalization), intersection, union. Programming implementations of DFA and NFA, curcuit implementations. 3. Extensions to translation, Mealey, Moore, conversions. Operations on regular grammars, conversions to FA. 4. Regular expressions, conversions among regular expressions, finite automata and regular grammars, Kleene theorem. Principles of use of regular expressions in UNIXu (grep, egrep, perl, PHP, ...). 5. Finite automaton as lexical analyzer, lex/flex generators. Properties of regular languages (pumping lemma, Nerode theorem). 6. Context-free languages, pushdown automaton. Parsing of context-free languages (nondeterministic versus deterministic). 7. Context-sensitive and recursively enumerable languages, Turing machine. Seminar syllabus:
1. Examples of formal languages. Intuitive considerations of grammars for given languages. Estimation of the classification of given language in Chomsky hierarchy. Intuitive creation of finite automata (DFA, NFA, with epsilon transitions) for given langauage. Transformations and compositins of FA. Implementation of FA. FA with output function and its implementation. 2. Conversions of grammars to FA and vice versa. Considerations, modifications and transformations of regular expressions. Use of regular expressions for solving tasks of processing text (e.g. sh, grep, sed, perl). Creation and implementation of lexical analyzer. Classification of languages. 3. Examples of context-free languages, creation of pushdown automata. Examples of deterministic parsing of context-free languages (e.g. LL, yacc, bison). Examples of context-sensitive and recursively enumerable languages, creation of Turing machines. Literature:
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. Requirements:
Knowledge of basic data structures and computer programming.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BIK-AAG/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester BIK-SPOL.2015 Unspecified Branch/Specialisation of Study PP 3 BIK-BIT.2020 Computer Security and Information technology PP 3 BIK-WSI-SI.2015 Web and Software Engineering PP 3 BIK-BIT.2015 Computer Security and Information technology PP 3
Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška