Tighter construction of tight Büchi automata

DOI10.1007/978-3-031-57228-9_12MaRDI QIDQ6629461zbMATH OpenFDO

Authors Marek Jankola, Jan Strejček

Publication date 30 October 2024

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1670781 (Why is no real title available?)
• scientific article; zbMATH DE number 1759609 (Why is no real title available?)
• scientific article; zbMATH DE number 1796123 (Why is no real title available?)
• scientific article; zbMATH DE number 1903365 (Why is no real title available?)
• scientific article; zbMATH DE number 2102704 (Why is no real title available?)
• Efficient reduction of nondeterministic automata with application to language inclusion testing
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• From Spot 2.0 to Spot 2.10: What’s New?
• How hard is finding shortest counter-example lassos in model checking?
• Model Checking Software
• Model Checking Software
• Practical applications of the alternating cycle decomposition
• Short Witnesses and Accepting Lassos in ω-Automata
• Tools and Algorithms for the Construction and Analysis of Systems

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)