Formale Systeme, Automaten, Prozesse
Lecture in Summer Term 2015
Automata and grammar are the default tools of the coder to model and transform systems and processes. Furthermore they are the bases for definitions and translations of programming languages and algorithms of character lines, known as pattern-matching.
The first key element of the lecture is the model of the finite automata, for its behavior can be described through regular expressions and so the question arises which computer science systems can be modelled with finite automata. The second one focuses on the specification of data through grammar, the discovery through Keller Automata and the connection to other formalisms. It primarily explores algorithmic questions, like if the equivalence between automata and grammar is decidable and if so, how efficent this can be done.
Lecture will be held in German.