Course description

Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles Instructions

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.

BI-AAG.21 Automata and Grammars Extent of teaching: 2P+2C

Instructor: Holub J., Janoušek J. Completion: Z,ZK

Department: 18101 Credits: 5 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, context-free grammars, construction and use of pushdown automata, and translation grammars and transducers. They know the hierarchy of formal languages and they understand the relationships between formal languages and automata. They are introduced to the Turing machine and complexity classes P and NP.

Lecture syllabus:

1. Basic notions, Chomsky hierarchy.

2. Deterministic and nondeterministic finite automata.

3. Operations on automata.

4. Regular expressions.

5. Conversions between regular grammars, regular expressions, and finite automata.

6. Properties of regular languages.

7. Context-free grammars.

8. Pushdown automata. Parsing.

9. Translation grammars and transducers.

10. Context-sensitive, recursively enumerable and recursive languages. Turing machine.

11. Time complexity, classes P and NP.

12. Program and circuit implementation of finite automata.

13. Finite automaton as a lexical analyzer.

Seminar syllabus:

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.

Literature:

1. Sipser M. : Introduction to the Theory of Computation. Cengage Learning Custom Publishing, 2020. ISBN 978-0357670583.

2. Hopcroft J.E., Motwani R., Ullman J. D. : Introduction to Automata Theory, Languages, and Computation, 3rd Edition. Pearson, 2008. ISBN 978-8131720479.

3. Kozen D. C. : Automata and Computability. Springer, 1997. ISBN 978-0387949079.

4. Šestáková E.: Automaty a gramatiky: Sbírka řešených příkladů, ČVUT 2017, ISBN 978-80-01-06306-4

5. Šestáková E.: Automata and Grammars, A Collection of exercises and Solutions, ČVUT, 2018, ISBN 978-80-01-06462-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/BI-AAG/

The course is also part of the following Study plans:

Study Plan Study Branch/Specialization Role Recommended semester

BI-SPOL.21 Unspecified Branch/Specialisation of Study PP 3/5

BI-PI.21 Computer Engineering 2021 (in Czech) PP 3/5

BI-PG.21 Computer Graphics 2021 (in Czech) PP 3/5

BI-MI.21 Business Informatics 2021 (In Czech) PP 3/5

BI-IB.21 Information Security 2021 (in Czech) PP 3/5

BI-PS.21 Computer Networks and Internet 2021 (in Czech) PP 3/5

BI-PV.21 Computer Systems and Virtualization 2021 (in Czech) PP 3/5

BI-SI.21 Software Engineering 2021 (in Czech) PP 3/5

BI-TI.21 Computer Science 2021 (in Czech) PP 3/5

BI-UI.21 Artificial Intelligence 2021 (in Czech) PP 3/5

BI-WI.21 Web Engineering 2021 (in Czech) PP 3/5

BI-SPOL.21 Unspecified Branch/Specialisation of Study PP 3/5

Page updated 25. 4. 2024, semester: Z,L/2023-4, Z/2019-20, Z/2024-5, L/2022-3, Z/2020-1, Z,L/2021-2, L/2020-1, Z/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška

BI-AAG.21	Automata and Grammars			Extent of teaching:	2P+2C
Instructor:	Holub J., Janoušek J.			Completion:	Z,ZK
Department:	18101	Credits:	5	Semester:	Z

1.		Basic notions, Chomsky hierarchy.
2.		Deterministic and nondeterministic finite automata.
3.		Operations on automata.
4.		Regular expressions.
5.		Conversions between regular grammars, regular expressions, and finite automata.
6.		Properties of regular languages.
7.		Context-free grammars.
8.		Pushdown automata. Parsing.
9.		Translation grammars and transducers.
10.		Context-sensitive, recursively enumerable and recursive languages. Turing machine.
11.		Time complexity, classes P and NP.
12.		Program and circuit implementation of finite automata.
13.		Finite automaton as a lexical analyzer.

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.

1.		Sipser M. : Introduction to the Theory of Computation. Cengage Learning Custom Publishing, 2020. ISBN 978-0357670583.
2.		Hopcroft J.E., Motwani R., Ullman J. D. : Introduction to Automata Theory, Languages, and Computation, 3rd Edition. Pearson, 2008. ISBN 978-8131720479.
3.		Kozen D. C. : Automata and Computability. Springer, 1997. ISBN 978-0387949079.
4.		Šestáková E.: Automaty a gramatiky: Sbírka řešených příkladů, ČVUT 2017, ISBN 978-80-01-06306-4
5.		Šestáková E.: Automata and Grammars, A Collection of exercises and Solutions, ČVUT, 2018, ISBN 978-80-01-06462-7