Pages that link to "Item:Q5277776"
From MaRDI portal
The following pages link to Logical definability and query languages over ranked and unranked trees (Q5277776):
Displaying 10 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Logics for Unordered Trees with Data Constraints on Siblings (Q2799171) (← links)
- Weak Kripke Structures and LTL (Q3090846) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- On deciding well-definedness for query languages on trees (Q3546341) (← links)
- A syntactic characterization of bounded-rank decision trees in terms of decision lists (Q4349779) (← links)
- Automata, Languages and Programming (Q5716799) (← links)