Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization

DOI10.1007/978-3-540-73420-8_76MaRDI QIDQ5428867zbMATH OpenOpenAlexFDO

Authors Marcelo Arenas, Pablo Barceló, Leonid 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

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Regular languages of nested words: fixed points, automata, and synchronization
• Weighted logics for nested words and algebraic formal power series
• Marrying Words and Trees
• Marrying Words and Trees
• Adding nesting structure to words

Cited in

(13)

• Nondeterministic state complexity of nested word automata
• Visibly rational expressions
• Synchronizing automata over nested words
• Alternation elimination for automata over nested words
• Descriptional complexity of input-driven pushdown automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• State Complexity of Nested Word Automata
• Descriptional complexity of unambiguous input-driven pushdown automata
• Synchronizing automata over nested words
• Limitations of lower bound methods for deterministic nested word automata
• Evolving schemas for streaming XML
• Regular languages of nested words: fixed points, automata, and synchronization
• Visibly linear temporal logic

This page was built for publication: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization

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