From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism

We study transformations of automata and games using Muller conditions into equivalent ones using parity or Rabin conditions. We present two transformations, one that turns a deterministic Muller automaton into an equivalent deterministic parity automaton, and another that provides an equivalent his...

Descrizione completa

Dettagli Bibliografici

Autori principali:	Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	TheoretiCS Foundation e.V. 2024-04-01
Serie:	TheoretiCS
Soggetti:	computer science - formal languages and automata theory computer science - logic in computer science 68q45 f.4.3
Accesso online:	http://theoretics.episciences.org/11336/pdf
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!