UIKS033 Introduction to Theoretical Computer Science

Faculty of Philosophy and Science in Opava
Winter 2018
Extent and Intensity
2/0/0. 5 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
Guaranteed by
doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava
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
Course objectives
The basic themes of the course are abstract machines, formal grammars and languages, the notion of computability and complexity of automata, languages and computation. The behavior of individual objects and phenomena and the consequences of collaboration collective behavior of objects will be discussed. Students will become familiar with the Turing machine, pushdown automaton and finite automaton, relatiton between machines and formal grammars. The subject of study will also limit access to machine a generative approach to solving a related concept (un) decidability.
Teaching methods
Interactive lecture
Lecture with a video analysis
Assessment methods
Exam
Language of instruction
Czech
Further comments (probably available only in Czech)
The course can also be completed outside the examination period.
Teacher's information
Knowledge of basic theory in the range of textbooks, problem solving knowledge of the text and numeric options. Examination exam consists of three questions on the theory (definition, theorems, proofs), and five examples.
The course is also listed under the following terms Winter 2015, Winter 2016, Winter 2017, Winter 2019, Winter 2020, Winter 2021, Winter 2022.
  • Enrolment Statistics (Winter 2018, recent)
  • Permalink: https://is.slu.cz/course/fpf/winter2018/UIKS033