FPF:UBKINSNK06 Introduction to TCS - Course Information
UBKINSNK06 Introduction to Theoretical Computer Science
Faculty of Philosophy and Science in OpavaWinter 2024
- Extent and Intensity
- 0/0/0. 6 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Luděk Cienciala, Ph.D. (lecturer)
doc. RNDr. Lucie Ciencialová, Ph.D. (lecturer)
doc. RNDr. Lucie Ciencialová, Ph.D. (seminar tutor) - Guaranteed by
- doc. RNDr. Lucie Ciencialová, Ph.D.
Institute of The Czech Language and Library Science – Faculty of Philosophy and Science in Opava
Supplier department: 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
- Information Studies (programme FPF, KNIH-nav)
- 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.
- Learning outcomes
- Upon completion of the course the student will be able to:
- explain the difference between generative and machine approaches to problem solving;
- define types of Chomsky grammars;
- associate the types of languages with a machine that recognizes them;
- analyze the behavior of both grammars and machines; - Syllabus
- 1. Alphabet, word, language. The finite representation of languages.
- 2. Grammars.
- 3. Finite automata and regular languages.
- 4. Pushdown automata.
- 5. Context-free grammars and languages.
- 6. Introduction to computability theory.
- Literature
- required literature
- CIENCIALOVÁ, Lucie. Teoretické základy informatiky. Opava: Slezská univerzita v Opavě, 2014. ISBN 978-80-7510-130-3. info
- recommended literature
- ČERNÁ, I, M KŘETÍNSKÝ and A KUČERA. Automaty a formální jazyky I. Brno: FI MU, 2002. info
- not specified
- CHYTIL, M. Automaty a gramatiky. Praha: SNTL, 1984. info
- Teaching methods
- Interactive lecture
Lecture with a discussion - Assessment methods
- Credit: written. 75 % participation in the exercises is compulsory. Examination: written.
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Information on the extent and intensity of the course: 14 hod/sem.
- Enrolment Statistics (recent)
- Permalink: https://is.slu.cz/course/fpf/winter2024/UBKINSNK06