FPF:UIN1005 Theory of Languages and Automa - Course Information

UIN1005 Theory of Languages and Automata I

Extent and Intensity

2/2/0. 4 credit(s). Type of Completion: z (credit).

Teacher(s)

prof. RNDr. Alice Kelemenová, CSc. (lecturer)
RNDr. Šárka Vavrečková, Ph.D. (lecturer)

Guaranteed by

RNDr. Šárka Vavrečková, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava

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

The objective of the course is to introduce to theory of informatics, especially to theory of formal languages. We deal with finite automata, regular expressions and simple formal grammars. The presented structures can be used for various purposes such as modelling and simulation in programming.

Syllabus

• Alphabet, formal languages, operations with formal languages.
  Finite automaton.
  Regular languages, Pumping lemma for regular languages, regular expressions, regular grammars.
  Closure properties of regular languages.
  Chomski hierarchy of languages.
  Context-free languages, their variations and properties.
  Normal forms of context-free languages.
  Pumping lemma for context-free langages.

Literature

required literature
• VAVREČKOVÁ, Š. Prezentace (presentations). URL info

recommended literature
• GRUSKA, J. Foundations of Computing. London: International Thomson Computer Press, 1997. info
• DEMLOVÁ, M. - KOUBEK, V. Algebraická teorie automatů. Praha: SNTL, 1990. info
• MOLNÁR, Ľ. - ČEŠKA, M. - MELICHAR, B. Gramatiky a jazyky. Bratislava: Alfa, 1987. info
• MEDUNA, A. MEDUNA, A. Gramatiky, automaty a kompilátory. Brno: VUT, 1987. info
• HOPCROFT, J. E. - ULLMAN, J. D. Teória jazykov a automatov. Bratislava: Alfa, 1987. info
• CHYTIL, M. Automaty a gramatiky. Praha: SNTL, 1984. info

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
Účast na výuce	12
Summary	24

• Enrolment Statistics (Summer 2011, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2011/UIN1005