IA072 Seminar on Concurrency

Programme

Regular languages over finite words are the best-behaved class one can imagine, nicely characterised in monadic second order logic. For infinite words the classic family of (omega-)regular languages starts to behave a bit funny but still acceptable. It is just not the only such class any more. I will introduce several possible extensions described in terms of automata, logic, or both. Then I will try to persuade you that these classes may not be less "regular" than the classic one. Finally, interesting open questions may be raised (both by me and the audience).

Předchozí
Následující