Short Witnesses and Accepting Lassos in ω-Automata

DOI10.1007/978-3-642-13089-2_22MaRDI QIDQ3564867zbMATH OpenOpenAlexFDO

Authors Rüdiger Ehlers

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_22

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• Accepting conditions for automata on -languages
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• Efficient minimization of deterministic weak -automata
• Approximate automata for omega-regular languages
• scientific article; zbMATH DE number 4179361
• Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
• -automata
• ω-Automata
• Probabilistic ω-automata
• On alternating \(\omega\)-automata

Cited in

(5)

• Approximate automata for omega-regular languages
• Generic emptiness check for fun and profit
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• How hard is finding shortest counter-example lassos in model checking?
• Tighter construction of tight Büchi automata

This page was built for publication: Short Witnesses and Accepting Lassos in ω-Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564867)