Tighter construction of tight Büchi automata

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

Jan Strejček, Marek Jankola

Publication date: 30 October 2024

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model Checking Software
• Tools and Algorithms for the Construction and Analysis of Systems
• Model Checking Software
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• Short Witnesses and Accepting Lassos in ω-Automata
• 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?

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

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