Query Automata for Nested Words

DOI10.1007/978-3-642-03816-7_48zbMath1250.68169OpenAlexW1769286860MaRDI QIDQ3182955

P. Madhusudan, Mahesh Viswanathan

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Colored nested words ⋮ Visibly pushdown transducers ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ Visibly rational expressions ⋮ Visibly linear temporal logic ⋮ Unnamed Item ⋮ Early nested word automata for XPath query answering on XML streams

Cites Work

• Streaming tree automata
• Query automata over finite trees
• Visibly pushdown languages
• Adding Nesting Structure to Words
• Parallel and two-way automata on directed ordered acyclic graphs
• MSO definable string transductions and two-way finite-state transducers
• Rewriting Techniques and Applications

This page was built for publication: Query Automata for Nested Words