Short Witnesses and Accepting Lassos in ω-Automata
From MaRDI portal
Publication:3564867
DOI10.1007/978-3-642-13089-2_22zbMath1284.68349OpenAlexW1501480203MaRDI QIDQ3564867
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
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
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
