FPF:UIN1105 Theory of languages and automa - Course Information

UIN1105 Theory of languages and automata I

Extent and Intensity

2/2/0. 6 credit(s). Type of Completion: zk (examination).

Teacher(s)

doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
doc. RNDr. Lucie Ciencialová, Ph.D. (seminar tutor)
Mgr. Ondřej Mazurek (seminar tutor)
RNDr. Radka Poláková, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava

Timetable

Tue 14:45–16:20 B4

• Timetable of Seminar Groups:

UIN1105/A: Thu 10:35–12:10 B2, R. Poláková

Prerequisites (in Czech)

! UIN1005 Theory of Languages and Automa || ! XX_0381 Teoretické základy informatiky

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)
• Computer Science and Technology (programme FPF, B1801 Inf)
• Mathematical Methods in Economics (programme MU, B1101)
• Mathematics (programme MU, B1101)

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 grammars, their variations and properties.
  

Literature

required literature
• Vavrečková, Šárka. WWW stránky předmětu, skripta. 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
Exam

Language of instruction

Czech

Further comments (probably available only in Czech)

Study Materials
The course can also be completed outside the examination period.

Teacher's information

Credits from the exercises. Written exam.

Activity	Difficulty [h]
Cvičení	20
Přednáška	20
Příprava na zápočet	15
Příprava na zkoušku	15
Summary	70

• Enrolment Statistics (Summer 2022, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2022/UIN1105