Bi-Weekly Talk: Anton Pirogov: Ambiguity in Probabilistic Büchi Automata

Mittwoch, 20.05.2020, 10.30 Uhr

Ort: Zoom Meeting

Vortragender: Anton Pirogov



Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. This talk presents new classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical ω-automata. (joint work with Christof Löding)





Externe Links