Tighter construction of tight Büchi automata

DOI10.1007/978-3-031-57228-9_12MaRDI QIDQ6629461

Jan Strejček, Marek Jankola

Publication date: 30 October 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Short Witnesses and Accepting Lassos in ω-Automata
• Model Checking Software
• Tools and Algorithms for the Construction and Analysis of Systems
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• Model Checking Software
• From Spot 2.0 to Spot 2.10: What’s New?
• Practical applications of the alternating cycle decomposition
• How hard is finding shortest counter-example lassos in model checking?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tighter construction of tight Büchi automata