13D111FJA - Formal Languages and Automata
| Course specification | ||||
|---|---|---|---|---|
| Course title | Formal Languages and Automata | |||
| Acronym | 13D111FJA | |||
| Study programme | Electrical Engineering and Computing | |||
| Module | Software Engineering | |||
| Type of study | doctoral studies | |||
| Lecturer (for classes) | ||||
| Lecturer/Associate (for practice) | ||||
| Lecturer/Associate (for OTC) | ||||
| ESPB | 9.0 | Status | elective | |
| Condition | Discrete mathematics | |||
| The goal | Introduction into theory of formal languages and automata and their significance for computer science. | |||
| The outcome | Students should learn the techniques of representing the problems by using of finite automata and techniques of specification of formal languages. | |||
| Contents | ||||
| 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 | ||||
| Literature | ||||
| ||||
| Number of hours per week during the semester/trimester/year | ||||
| Lectures | Exercises | OTC | Study and Research | Other classes |
| 6 | ||||
| Methods of teaching | Lectures and individual consultations. | |||
| Knowledge score (maximum points 100) | ||||
| Pre obligations | Points | Final exam | Points | |
| Activites during lectures | 0 | Test paper | 0 | |
| Practical lessons | 0 | Oral examination | 50 | |
| Projects | ||||
| Colloquia | 0 | |||
| Seminars | 50 | |||