The following pages link to Term Rewriting and Applications (Q5703872):
Displaying 16 items.
- Automata for unordered trees (Q515668) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- Logics for Unordered Trees with Data Constraints on Siblings (Q2799171) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- (Q4964022) (← links)
- (Q4995369) (← links)
- Logical definability and query languages over ranked and unranked trees (Q5277776) (← links)
- Finite Automata on Unranked and Unordered DAGs (Q5428246) (← links)
- Unranked Tree Automata with Sibling Equalities and Disequalities (Q5428866) (← links)
- An Automata Theoretic Approach to Rational Tree Relations (Q5448669) (← links)
- Automata, Languages and Programming (Q5466544) (← links)
- Automata, Languages and Programming (Q5716799) (← links)