The following pages link to (Q3468622):
Displaying 7 items.
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← 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)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)