UIN1005 Theory of Languages and Automata I

Faculty of Philosophy and Science in Opava
Summer 2013
Extent and Intensity
0/0/0. 4 credit(s). Type of Completion: z (credit).
Guaranteed by
RNDr. Šárka Vavrečková, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava
Prerequisites (in Czech)
! UIN1105 Theory of Languages and Automa || ! XX_0381 Teoretické základy informatiky || ! UINK105 Theory of Languages and Automa
Course Enrolment Limitations
The course is offered to students of any study field.
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.
Language of instruction
Czech
Further Comments
The course can also be completed outside the examination period.
The course is also listed under the following terms Summer 1994, Summer 1995, Summer 1996, Summer 1997, Summer 1998, Summer 1999, Summer 2000, Summer 2001, Summer 2002, Summer 2004, Summer 2006, Summer 2007, Summer 2008, Summer 2009, Summer 2010, Summer 2011, Summer 2012.
  • Enrolment Statistics (recent)
  • Permalink: https://is.slu.cz/course/fpf/summer2013/UIN1005