Formale Systeme, Automaten, Prozesse

 

Lecture in Summer Term 2018

 
NFA to DFA Copyright: M. Ritzert

Contact

Phone

work
+49 241 80 21702

Email

E-Mail
 

Dates

Lecture
Mo, 10:15 - 11:45am (Grüner Hörsaal AM)
Tu, 10:15 - 11:45am (Roter Hörsaal AM)

Exercise Class
Mo, 6:15 - 7:45pm (OTTO FUCHS-Hörsaal H03)

 
 

Content

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.

 

Organization

The lecture will be held in German.

Lecturer

Martin Grohe