The following pages link to Query automata over finite trees (Q1607226):
Displaying 20 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Weighted monadic Datalog (Q944376) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Document Spanners (Q2796400) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data (Q5738985) (← links)
