Alternation Elimination for Automata over Nested Words

DOI10.1007/978-3-642-19805-2_12zbMath1326.68175OpenAlexW2134068041MaRDI QIDQ3000607

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Visibly linear temporal logic

This page was built for publication: Alternation Elimination for Automata over Nested Words