| INFB Formal Languages / Automata Theory | Course | INF | |
|---|---|---|---|
| Lecturers : |
Prof. Dr. rer. nat. Friedhelm Mündemann eMail | Homepage Prof. Dr. rer. nat. habil. Jörg Richard Weimar eMail | Homepage |
Term | 2 |
| Course Classification : | Informatics Bachelor | CH | 4 |
| Language : | english | 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 : | |||
| 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 : | Kaiser, Mlitz, Zeilinger: Algebra für Informati-ker Schmidt, Ströhlein: Relations and Graphs, Stetter: Grundbegriffe der Theoretischen Informa-tik Cap: Theoretische Grundlagen der Informatik | ||