Query Automata for Nested Words

DOI10.1007/978-3-642-03816-7_48MaRDI QIDQ3182955zbMATH OpenOpenAlexFDO

Authors Parthasarathy 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)

Recommendations

• Earliest Query Answering for Deterministic Nested Word Automata
• Alternation elimination for automata over nested words
• Query automata over finite trees
• Nested weighted automata
• Nested weighted automata
• Cost register automata for nested words
• Database Programming Languages
• State Complexity of Nested Word Automata

Cites work

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

Cited in

(9)

• Visibly linear temporal logic
• Conjunctive visibly-pushdown path queries
• Early nested word automata for XPath query answering on XML streams
• Colored nested words
• Visibly rational expressions
• Regular languages of nested words: fixed points, automata, and synchronization
• Streamability of nested word transductions
• Visibly pushdown transducers
• Subhedge projection for stepwise hedge automata

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

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