On complementation of nondeterministic finite automata without full determinization

DOI10.1007/978-3-032-04700-7_17MaRDI QIDQ6852222zbMATH OpenFDO

Authors Lukáš Holik, Ondřej Lengál, Juraj Major, Adéla Štěpková, Jan Strejček

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_17

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A simple and optimal complementation algorithm for Büchi automata
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Complementation of Emerson-Lei automata
• Efficient minimization of DFAs with partial transition
• Five Determinisation Algorithms
• scientific article; zbMATH DE number 1670771 (Why is no real title available?)
• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3510287 (Why is no real title available?)
• scientific article; zbMATH DE number 1962776 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Lazy automata techniques for WS1S
• Nested antichains for WS1S
• Nondeterminism and the size of two way finite automata
• Partial orders on words, minimal elements of regular languages, and state complexity
• Seminator 2 can complement generalized Büchi automata via improved semi-determinization
• Simulation-based minimization
• State complexity of some operations on binary regular languages
• Symbolic model checking with rich assertional languages

This page was built for publication: On complementation of nondeterministic finite automata without full determinization

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