Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
From MaRDI portal
Publication:5428867
DOI10.1007/978-3-540-73420-8_76zbMath1171.68521MaRDI 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
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Descriptional complexity of unambiguous input-driven pushdown automata, Limitations of lower bound methods for deterministic nested word automata, Evolving schemas for streaming XML, Visibly linear temporal logic, Nondeterministic state complexity of nested word automata, Visibly rational expressions, Descriptional Complexity of Input-Driven Pushdown Automata, Weighted Logics for Nested Words and Algebraic Formal Power Series, State Complexity of Nested Word Automata