The following pages link to (Q4005178):
Displaying 13 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- On ground word problem of term equation systems (Q2803061) (← links)
- Computing ground reducibility and inductively complete positions (Q5055712) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
