FPF:UIN1006 Theory of Languages and Automa - Course Information
UIN1006 Theory of Languages and Automata II
Faculty of Philosophy and Science in OpavaWinter 2010
- Extent and Intensity
- 2/2/0. 6 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- RNDr. Šárka Vavrečková, Ph.D. (lecturer)
RNDr. Šárka Vavrečková, Ph.D. (seminar tutor) - Guaranteed by
- RNDr. Šárka Vavrečková, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites (in Czech)
- UIAI012 The Basis of Theoretical Compu || UIAI212 The Basis of Theoretical Compu || UIBUC56 Theory of Languages and Automa || UINK115 Theory of Languages and Automa || UIN1105 Theory of Languages and Automa
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Mathematics (programme MU, B1101)
- Applied Mathematics in Risk Management (programme MU, B1101)
- Applied Mathematics in Risk Management (programme MU, B1102)
- Geometry (programme MU, M1101)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Computer Science and Technology (programme FPF, M1801 Inf)
- Mathematical Analysis (programme MU, M1101)
- Mathematical Methods in Economics (programme MU, B1101)
- Mathematics (programme MU, B1101)
- Secondary School Teacher Training in Computer Science (programme FPF, M7504)
- Secondary school teacher training in general subjects with specialization in Computer Science (programme FPF, M7504)
- Course objectives
- In this course we go over the more complicated structures and processes - pushdown automata, Turing machines and complex Chomski and non-Chomski grammars, sequential and parallel modes.
- Syllabus
- Criteria for context-free languages.
Pushdown automata, variants, types of accepting.
Closure properties of context-free languages.
Grammars of type 0, Turing machines.
Grammars of type 1, linearly bounded automata.
Derivation modes, parallelism.
L-Systems, matrix grammars, grammar systems, colonies.
- Criteria for context-free languages.
- Teaching methods
- Interactive lecture
Lecture supplemented with a discussion
Lecture with a video analysis - Assessment methods
- Written exam
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- The course can also be completed outside the examination period.
- Teacher's information
Activity Difficulty [h] Příprava na zápočet 12 Příprava na zkoušku 12 Summary 24
- Enrolment Statistics (Winter 2010, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2010/UIN1006