Alternation Elimination by Complementation (Extended Abstract)

DOI10.1007/978-3-540-89439-1_16MaRDI QIDQ5505555zbMATH OpenOpenAlexFDO

Authors Christian Dax, Felix Klaedtke

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Alternation elimination for automata over nested words
• Constructions for alternating finite automata^∗
• Weak alternating automata are not that weak
• Alternation removal in Büchi automata
• Complement for two-way alternating automata

Cited in

(10)

• Alternation elimination for automata over nested words
• Size-change termination and satisfiability for linear-time temporal logics
• Constructions for alternating finite automata^∗
• Alternation removal in Büchi automata
• The complexity of flat freeze LTL
• Partially ordered automata and piecewise testability
• The complexity of flat freeze LTL
• Subset mapping problems in solvable automata
• Inquisitive team semantics of LTL
• On regular temporal logics with past

This page was built for publication: Alternation Elimination by Complementation (Extended Abstract)

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