| INFB Formal Languages / Automata Theory | Course | INF | |
|---|---|---|---|
| Lecturers : |
Dipl.-Inf. (FH) Tobias Kiertscher eMail Prof. Dr. Rolf Socher eMail |
Term | 2 |
| Course Classification : | Informatics Bachelor | CH | 4 |
| Language : | Deutsch | Type | L E |
| Type of examination : | PL | Credits | 4 |
| 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 : | Knowledge of the basic concepts and methods Ability to construct, analyze and apply automata Ability to apply transformations of automata Knowledge of the relation between the different concepts (formal languages and automata) | ||
| Contents : | Theory of formal Languages (concept of formal languages, regular expressions, grammars, derivations, Chomsky hierarchy) | ||
| Literature : | Asteroth, Baier: Theoretische Informatik Hopcroft, Ullman: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie Socher: Theoretische Grundlagen der Informatik Vossen, Witt: Grundkurs theoretische Informatik | ||