| ACS Formal Languages / Automata Theory | Course | INF | |
|---|---|---|---|
| Lecturers : |
Prof. Dr. Matthias Homeister
eMail
|
Term | 2 |
| Course Classification : | Bachelor Applied Computer Science | CH | 4 |
| Language : | Englisch | Type | VÜ |
| Type of examination : | PL | Credits | 4 |
| Method of evaluation : | written examination 120 min | ||
| Requirements : |
Computer Science and Logic
Mathematics I | ||
| Cross References : | |||
| Previous knowledges : | Mathematics I Programming I | ||
| Aids and special features : | Mode of assessment Students assignments during the semester can count towards their final. | ||
| 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 A., Baier Ch.: Theoretische Informatik. München: Pearson Studium 2002 Hopcroft J. E., Motwani R., Ullman J. D.: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie. 3. Aufl. München: Pearson Studium 2011 Socher R.: Theoretische Grundlagen der Informatik. 3. Aufl. München: Hanser Verlag 2008 Vossen G., Witt K.-U.: Grundkurs theoretische Informatik. 5. Aufl. Wiesbaden: Springer Fachmedien Wiesbaden | ||