Alternation elimination for automata over nested words

DOI10.1007/978-3-642-19805-2_12zbMATH Open1326.68175OpenAlexW2134068041MaRDI QIDQ3000607FDOQ3000607

Christian Dax, Felix Klaedtke

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_12

Recommendations

• Alternation Elimination by Complementation (Extended Abstract)
• Regular languages of nested words: fixed points, automata, and synchronization
• Marrying Words and Trees
• Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
• Alternation removal in Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Visibly linear temporal logic
• Query Automata for Nested Words
• Temporal logics for concurrent recursive programs: satisfiability and model checking

This page was built for publication: Alternation elimination for automata over nested words

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