The following pages link to Term Rewriting and Applications (Q5703872):
Displayed 6 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)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- Presburger Büchi tree automata with applications to logics with expressive counting (Q6160751) (← links)