The following pages link to (Q3058276):
Displaying 5 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- Reasoning formally about database queries and updates (Q6535969) (← links)
