Complementation of Emerson-Lei automata

DOI10.1007/978-3-031-90897-2_5MaRDI QIDQ6889894zbMATH OpenFDO

Authors Vojtěch Havlena, Ondřej Lengál

Publication date 4 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-90897-2_5

Mathematics Subject Classification ID

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

Cites work

• A modular approach for Büchi determinization
• A simple and optimal complementation algorithm for Büchi automata
• Automata, logics, and infinite games. A guide to current research
• BÜCHI COMPLEMENTATION MADE TIGHTER
• Büchi complementation made tight
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Complementing Büchi Automata with Ranker
• Complementing deterministic Büchi automata in polynomial time
• Complementing semi-deterministic Büchi automata
• Decidability for Sturmian words
• Determinising parity automata
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
• From complementation to certification
• scientific article; zbMATH DE number 3866588 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Improved Ramsey-based Büchi complementation
• Learning to complement Büchi automata
• Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
• Making Streett Determinization Tight
• Modalities for model checking: Branching time logic strikes back
• Modular mix-and-match complementation of Büchi automata
• On minimal odd rankings for Büchi complementation
• On the power of finite ambiguity in Büchi complementation
• On the power of unambiguity in Büchi complementation
• Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
• Seminator 2 can complement generalized Büchi automata via improved semi-determinization
• Simulations in rank-based Büchi automata complementation
• Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
• The Büchi Complementation Saga
• The complementation problem for Büchi automata with applications to temporal logic
• Tight bounds for complementing parity automata
• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
• Tight upper bounds for Streett and parity complementation
• Tools and Algorithms for the Construction and Analysis of Systems
• Weak alternating automata are not that weak
• Why These Automata Types?

Cited in

(1)

• On complementation of nondeterministic finite automata without full determinization

This page was built for publication: Complementation of Emerson-Lei automata

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