Determinization and Complementation of Streett Automata

DOI10.1007/3-540-36387-4_5MaRDI QIDQ4412828zbMATH OpenOpenAlexFDO

Authors Stefan Schwoon

Publication date 16 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36387-4_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4179361
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Determinization of Büchi-Automata
• Complementing semi-deterministic Büchi automata
• Complementing deterministic Büchi automata in polynomial time
• scientific article; zbMATH DE number 1408338
• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
• On complementing nondeterministic Büchi automata
• On the complementation of Büchi automata

Cited in

(10)

• Determinization and memoryless winning strategies
• Index appearance record with preorders
• Parityizing Rabin and Streett
• A tight lower bound for Streett complementation
• Index appearance record for transforming Rabin automata into parity automata
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• scientific article; zbMATH DE number 1189125 (Why is no real title available?)
• Can nondeterminism help complementation?
• Rabin vs. Streett automata
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata

This page was built for publication: Determinization and Complementation of Streett Automata

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