The following pages link to Marrying Words and Trees (Q3499762):
Displayed 16 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Evolving schemas for streaming XML (Q638517) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Rewriting of visibly pushdown languages for XML data integration (Q719268) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Visibly rational expressions (Q2453980) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Bounded Delay and Concurrency for Earliest Query Answering (Q3618594) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- Earliest query answering for deterministic stepwise hedge automata (Q6199862) (← links)