19D111FJA - Formal Languages and Automata
|Formal Languages and Automata
|Electrical Engineering and Computing
|Type of study
|Lecturer (for classes)
|Lecturer/Associate (for practice)
|Lecturer/Associate (for OTC)
|Introduction into theory of formal languages and automata and their significance for computer science.
|Students should learn the techniques of representing the problems by using of finite automata and techniques of specification of formal languages.
|Contents of lectures
|Theory of computation. Finite automata. Regular languages and regular grammars. Characteristics of regular languages. Context-free languages. Simplification of context-free grammars. Normal forms. Push-down automata. Characteristics of context-free grammars. Turing machines. Hierarchy of formal languages and automata. Constraints of algorithmic computations. Complexity of computations.
|Contents of exercises
|Number of hours per week during the semester/trimester/year
|Study and Research
|Methods of teaching
|Lectures and individual consultations.
|Knowledge score (maximum points 100)
|Activites during lectures