| INF1122 Formal languages and automata theory I | Course | INF | |
|---|---|---|---|
| Lecturer : |
Prof. Dr. rer. nat. Friedhelm Mündemann eMail | Homepage |
Term | 2 |
| Course Classification : | Informatics | CH | 3 |
| Language : | German | Type | L E |
| Type of examination : | PL | Credits | 4 |
| Method of evaluation : | written examination 120 min | ||
| Requirements : | Basics of information processing Mathematics I | ||
| Cross References : | |||
| Previous knowledge : | |||
| Aids and special features : | |||
| Teaching aims : | |||
| Contents : | In the first part the definition of computability will be looked at. Various types of formalisation of the intuitive algorithm concept will be introduced and compared. Consequences for computer science will be discussed. In the second part we will be analysing the concept of formal language and its fundamental significance for computer science, with particular reference to the description of the syntax of programming languages. In the final part the concept of automation will be the focus. Main points are; finite automaten, acceptors, turing machines, determinism and non-determinism. | ||
| Literature : | |||