Seminator 2 can complement generalized Büchi automata via improved semi-determinization

DOI10.1007/978-3-030-53291-8_2MaRDI QIDQ2226719zbMATH OpenOpenAlexWikidataFDO

Authors František Blahoudek, Alexandre Duret-Lutz, Jan Strejček

Publication date 9 February 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-53291-8_2

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to computer science (68-04) Formal languages and automata (68Q45)

Recommendations

• Complementing semi-deterministic Büchi automata
• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
• scientific article; zbMATH DE number 1408338
• On complementing nondeterministic Büchi automata
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Complementing deterministic Büchi automata in polynomial time
• On the complementation of Büchi automata
• Tighter Bounds for the Determinisation of Büchi Automata
• Two-way automata over locally finite semirings
• Semitopological semirings and pushdown automata

Cited in

(8)

• Seminator 2
• Complementing semi-deterministic Büchi automata
• Complementing Büchi Automata with Ranker
• Modular mix-and-match complementation of Büchi automata
• Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
• On complementation of nondeterministic finite automata without full determinization
• Complementation of Emerson-Lei automata
• On the minimisation of deterministic and history-deterministic generalised (co)Büchi automata

Describes a project that uses

Uses Software

• SPOT

This page was built for publication: Seminator 2 can complement generalized Büchi automata via improved semi-determinization

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