Course details
Theoretical Computer Science 1
TI1 Acad. year 2003/2004 Winter semester 6 credits
Applications of formal language theory, operations over formal languages, the problem of language specification, grammars, Chomsky hierarchy of formal languages, finite state automata, regular sets and expressions, Kleen's theorem, minimal finite automata, properties of regular languages, context-free grammars, syntactical analysis, transformations on context-free grammars, push-down automata and context-free languages, properties of context-free languages, Petri nets.
Guarantor
Language of instruction
Completion
Time span
Department
Subject specific learning outcomes and competences
Theoretical knowledge for application in problems of compiler construction, system modelling, formal specification, verification and artificial intelligence.
Learning objectives
Adoption of fundamental concepts and results of formal language theory used in compiler construction, computability, and system modelling.
Progress assessment
Mid-term exam evaluation and evaluation of projects dokumentation.
Course inclusion in study plans
- Programme EI-BC-3, field VTB, 1st year of study, Elective
- Programme EI-BC-3 (in English), field VTB, 1st year of study, Elective
- Programme EI-MGR-3, field VTN, 1st year of study, Compulsory
- Programme EI-MGR-5, field VTI, 1st year of study, Compulsory
- Programme EI-MGR-5 (in English), field VTI, 1st year of study, Compulsory