back to table of content


INFB  Formal Languages / Automata Theory CourseINF
Lecturers : Prof. Dr. rer. nat. Friedhelm Mündemann   eMail | Homepage
Prof. Dr. rer. nat. habil. Jörg Richard Weimar   eMail | Homepage
Term2
Course Classification : Informatics BachelorCH4
Language : Deutsch Type L E
Type of examination : PL  Credits
Method of evaluation : written examination 120 min 
Requirements : Introduction to Computer Science and Logic
Mathematics I
Cross References :  
Previous knowledges :  
Aids and special features : Mode of assessment
Successful completion of exercises, course examination
Graded: yes
Overall grade is the course examination grade. 
Teaching aims : Be able to navigate formal systems,
know limits of using algorithms and computing technology,
know how to define languages,
be familiar with automata, be able to construct, analyse and implement them, 
Contents :

Fundamental mathematical terms (sets, relationships, functions),
algorithms,
predictability theory, limits of predictability,
theory of formal languages (vocabularies, grammars, derivations, Chomsky’s hierarchy),
automata theory (finite automata, push-down machine, linear-limited automata, Turing machine 

Literature : Kaiser, Mlitz, Zeilinger: Algebra für Informatiker
Schmidt, Ströhlein: Relations and Graphs,
Stetter: Grundbegriffe der Theoretischen Informatik
Cap: Theoretische Grundlagen der Informatik 


back to table of content