Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

Languages, Automata and Grammars

The course is not on the list Without time-table
Code Completion Credits Range Language
XP01TJA ZK 4 2P+1S Czech
Garant předmětu:
Lecturer:
Tutor:
Supervisor:
Department of Mathematics
Synopsis:

Finite automata. Nerod theorem and its applications. Nondeterministic

automata. Regular expressions nad Kleene theorem. Grammars and their

classification. Cotnext-free grammars. Chomsky hierarchy. CYK

algorithm for context-free grammars. Turing machines, decision

problem. Algorithmically nonsolvable problems.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2001.

Note:
Further information:
http://math.feld.cvut.cz/demlova/teaching/tja.htm
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-06-16
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet11506904.html