Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

DOI10.1007/978-3-642-13089-2_10zbMath1284.68340OpenAlexW1533605922MaRDI QIDQ3564854

Christof Löding, Nicolas Bousquet

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ On the decidability of infix inclusion problem ⋮ Markov chains and unambiguous automata ⋮ Representing regular languages of infinite words using mod 2 multiplicity automata ⋮ Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata