Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Languages, automata and grammars

The course is not on the list Without time-table
Code Completion Credits Range Language
AD4B01JAG Z,ZK 6 14+6 Czech
Enrollement in the course requires an assessment of the following courses:
Discrete mathematics (AD4B01DMA)
Lecturer:
Tutor:
Supervisor:
Department of Mathematics
Synopsis:

The course covers basics of the theory of finite automata and grammars: deterministic and nondeterministic finite automata, characterization of the class of languages accepting by a finite automaton and description of such a language by a regular expression. Grammars and languages generated by a grammar, context-free grammars will be emphasized. The relation will be shown between context-free grammars and push down automata. Next topic is a Turing machine and the existence of non-decidable problems.

Requirements:

Discrete Mathematics

Syllabus of lectures:

1.Alphabet, strings over an alphabet, concatenation of words, language.

2.Deterministic finite automaton, state diagram.

3.Language accepted by a finite automaton, Nerode?s Theorem.

4.Nondeterministic finite automata.

5.Equivalence of deterministic and nondeterministic finite automata.

6.Regular expressions and regular languages, Kleen?s Theorem.

7.Properties of regular languages.

8.Grammars, regular grammars, context-free grammars.

9.Push down automata and their relation to context-free languages.

10.Properties of context-free languages, Pumping Lemma for context-free languages.

11.Algorithms for some problems concerning context-free languages.

12.Turing machines.

13.Non-decidable problems.

Syllabus of tutorials:

1.Alphabet, strings over an alphabet, concatenation of words, language.

2.Deterministic finite automaton, state diagram.

3.Language accepted by a finite automaton, Nerode?s Theorem.

4.Nondeterministic finite automata.

5.Equivalence of deterministic and nondeterministic finite automata.

6.Regular expressions and regular languages, Kleen?s Theorem.

7.Properties of regular languages.

8.Grammars, regular grammars, context-free grammars.

9.Push down automata and their relation to context-free languages.

10.Properties of context-free languages, Pumping Lemma for context-free languages.

11.Algorithms for some problems concerning context-free languages.

12.Turing machines.

13.Non-decidable problems.

Study Objective:
Study materials:

[1] J.E. Hopcroft, R. Motwani, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, 2001

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2019-10-18
For updated information see http://bilakniha.cvut.cz/en/predmet1201506.html