Alternation Elimination by Complementation (Extended Abstract)

DOI10.1007/978-3-540-89439-1_16zbMATH Open1182.68102OpenAlexW1566206239MaRDI QIDQ5505555FDOQ5505555

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Constructions for alternating finite automata^∗
• Size-change termination and satisfiability for linear-time temporal logics
• On regular temporal logics with past
• Title not available (Why is that?)
• The complexity of flat freeze LTL
• The complexity of flat freeze LTL
• Alternation removal in Büchi automata
• Alternation elimination for automata over nested words

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)