Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-STIAcad. year: 2014/2015
The course has a form of practical demonstration exercises with an active participation of the students in solving various concrete problems from the areas of the theory of formal languages and automata as well as the theory of computability and complexity. The examples being solved fall into the areas of advanced theory and applications of regular languages, context-free and context languages, Turing machines, decidability, reductions of decidability problems, computable functions, and basics of complexity. The application areas include modeling of systems, formal analysis and verification, compilers, artificial intelligence, linguistics, etc.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Broader and deeper abilities to formalize and solve problems of computer science as well as engineering, design algorithms as well as construct proofs. A student also acquires better abilities for research in various areas of computer science.
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
branch MBI , 1 year of study, winter semester, electivebranch MBS , 1 year of study, winter semester, electivebranch MIN , 1 year of study, winter semester, electivebranch MIS , 1 year of study, winter semester, electivebranch MMI , 1 year of study, winter semester, electivebranch MMM , 1 year of study, winter semester, electivebranch MPV , 1 year of study, winter semester, electivebranch MSK , 1 year of study, winter semester, electivebranch MGM , 1 year of study, winter semester, elective