LFU:online

Students

• know fundamental concepts of automata, formal languages, and computability
• understand the relations between these concepts
• are able to understand further theoretical work based on the principles

Propositional logic; automata theory and application; conventional languages; formalizing of languages/grammars; syntax and semantics in languages; computability; Turing-machine; halting problem and decidability; complexity of algorithms; p_ and NP-classes; procedures for solving NP problems;

Lecture, assessment is based on a single examination at the end of the course.

Course examination according to § 7, statute section on "study-law regulations".

Will be discussed in the first lesson.