Course details

# Theoretical Computer Science

TIN Acad. year 2017/2018 Winter semester 5 credits

Guarantor

Language of instruction

Completion

Time span

Assessment points

Department

Lecturer

Instructor

Holík Lukáš, Mgr., Ph.D. (DITS FIT BUT)

Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT)

Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT)

Subject specific learning outcomes and competences

Generic learning outcomes and competences

Learning objectives

Prerequisite kwnowledge and skills

Study literature

- Kozen, D.C.: Automata and Computability, Springer-Verlag, New Yourk, Inc, 1997. ISBN 0-387-94907-0
- Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, Addison Wesley, 2nd ed., 2000. ISBN 0-201-44124-1

Fundamental literature

- Kozen, D.C.: Automata and Computability, Springer-Verlag, New Yourk, Inc, 1997. ISBN 0-387-94907-0
- Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, Addison Wesley, 2nd ed., 2000. ISBN 0-201-44124-1
- Martin, J.C.: Introduction to Languages and the Theory of Computation, McGraw-Hill, Inc., 3rd ed., 2002. ISBN 0-072-32200-4
- Brookshear, J.G.: Theory of Computation: Formal Languages, Automata, and Complexity, The Benjamin/Cummings Publishing Company, Inc, Redwood City, California, 1989. ISBN 0-805-30143-7
- Aho, A.V., Ullmann, J.D.: The Theory of Parsing,Translation and Compiling, Prentice-Hall, 1972. ISBN 0-139-14564-8
- Reisig, W.: Petri Nets, An Introduction, Springer Verlag, 1985. ISBN: 0-387-13723-8

Syllabus of lectures

- An introduction to the theory of formal languages, regular languages and grammars, finite automata, regular expressions.
- Context-free languages and grammars, push-down automata.
- Regular languages as a Boolean algebra, Kleene's algebra, Kleene's theorem, minimization of finite-state automata.
- Pumping lemma, Nerod's theorem, decidable problems of regular languages. Transformations and normal forms of context-free grammars
- Advanced properties of context-free languages, Pumping lemma for context-free languages, decidable problems of context-free languages. Deterministic context-free languages.
- Turing machines (TMs), the language accepted by a TM, recursively enumerable and recursive languages and problems, TMs and functions, methods of constructing TMs.
- Modifications of TMs, TMs with a tape infinite on both sides, with more tapes, nondeterministic TMs, automata with two push-down stacks, automata with counters.
- TMs and type-0 languages, diagonalization, properties of recursively enumerable and recursive languages, linearly bounded automata and type-1 languages.
- The Church-Turing thesis, universal TMs, undecidability, the halting problem, reductions, Post's correspondence problem. Undecidable problems of the formal language theory.
- Computable functions, initial functions, primitive recursive functions, mu-recursive functions, the relation of TMs and computable functions, asymptotic complexity.
- An introduction to the computational complexity, Turing complexity,
- P and NP classes, and beyond. Polynomial reduction, Completeness.
- Introduction to Petri nets, motivations, definition of P/T Petri nets, methods of Petri net analyses, Petri net classes.

[The first two lectures summarize and formalize the body of knowledge acquired in the IFJ course. Lectures 3-5 deepen the knowledge in the area of regular and context-free languages. Lectures 6-12 introduce the fundamental principles and concepts in the area of computability and complexity of formal languages and problems. The last lecture introduces the fundamental principles in the area of mathematical description, modeling, and analysis of parallel and distributed dynamical systems using Petri Nets.]

Syllabus - others, projects and individual work of students

- Assignment in the area of regular and context free languages.
- Assignment in the area of Turing machines and the theory of undecidability.
- Assignment in the area of computable functions, complexity, and Petri nets.

Progress assessment

Controlled instruction

**Students have to achieve at least 25 points, otherwise the exam is assessed by 0 points.**

** **

Exam prerequisites

Course inclusion in study plans