Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata

DOI10.1016/j.ipl.2012.04.010zbMath1243.68201OpenAlexW1969561112MaRDI QIDQ436610

Christof Löding, Dimitri Isaak

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.010

zbMATH Keywords

automata theoryformal languagesinclusion\(\omega \)-automataunambiguous automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Process-centric views of data-driven business artifacts ⋮ Markov chains and unambiguous automata

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimization of XML schemas and tree automata for unranked trees
• Rational \(\omega\)-languages are non-ambiguous
• Unambiguous Büchi automata.
• Deciding Equivalence of Finite Tree Automata
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata

This page was built for publication: Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata