<?xml version="1.0" encoding="ISO-8859-1" standalone="yes" ?>
<document>
<title>Theoretical Informatics</title>
<cid>KIB-TI</cid>
<sapsubmodule>P222-0044</sapsubmodule>
<bkey>ki3</bkey>
<ctypes>
<hours>4</hours>
<type>V</type>
</ctypes>
<cp>5</cp>
<semester>4</semester>
<mandatory>yes</mandatory>
<language>German</language>
<exam>Written exam</exam>
<curriculum>
<curriculum_entry>
<cid>KIB-TI</cid>
<branch>Computer Science and Communication Systems</branch>
<semester>4</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>KIB-TI</cid>
<branch>Computer Science and Communication Systems</branch>
<semester>4</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>PIB-TI</cid>
<branch>Applied Informatics</branch>
<semester>4</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>PIB-TI</cid>
<branch>Applied Informatics</branch>
<semester>4</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>TIB-TI</cid>
<branch>Technical Computer Science</branch>
<semester>4</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
</curriculum>
<workload>
60 class hours (= 45 clock hours) over a 15-week period.The total student study time is 150 hours (equivalent to 5 ECTS credits).There are therefore 105 hours available for class preparation and follow-up work and exam preparation.</workload>
<prerequisites>
</prerequisites>
<prerequisitesfor>
</prerequisitesfor>
<convenor>Prof. Dr. Maximilian Altmeyer</convenor>
<convenor-person-key>mat</convenor-person-key>
<lecturers>
<lecturer>Prof. Dr. Maximilian Altmeyer</lecturer>
<lecturer-person-key>mat</lecturer-person-key>
</lecturers>
<objectives>After successfully completing this module, students will be familiar with the basic terms and concepts of theoretical informatics. They will be familiar with the characteristics of automatic machines and languages and can select and apply suitable theoretical concepts (e. g. finite automaton or pushdown automaton) for practical tasks.
</objectives>
<content>Mathematic principles
Regular languages
Finite automata
Nondeterminism
Regular expressions and languages
Context-free languages
Pushdown automata
Context-free grammar
Turing machines and variations
Decidability
Halting problem</content>
<media>Board, script, simulation software</media>
<literature>HOPCROFT J.E., ULLMANN J.D., MOTWANI R., Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie, Pearson, 2002
SIPSER Michael: Introduction to the theory of computation, Course Technology, 3rd edition, 2012</literature>
<offered>
<semshort>WS 2024/25</semshort>
<semshort>WS 2023/24</semshort>
</offered>
<moduldb-query>Sat Sep 12 07:37:26 CEST 2026, CKEY=kti, BKEY=ki3, CID=[?], LANGUAGE=en, DATE=12.09.2026</moduldb-query>
</document>
