Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
From MaRDI portal
Publication:5428867
DOI10.1007/978-3-540-73420-8_76zbMath1171.68521OpenAlexW1583868682MaRDI QIDQ5428867
Marcelo Arenas, Pablo Barceló, Leonid O. Libkin
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/127554
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (9)
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Weighted Logics for Nested Words and Algebraic Formal Power Series ⋮ Evolving schemas for streaming XML ⋮ Visibly rational expressions ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Visibly linear temporal logic ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Nondeterministic state complexity of nested word automata ⋮ State Complexity of Nested Word Automata
This page was built for publication: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
