The following pages link to (Q3485880):
Displaying 6 items.
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- CHAP and rewrite components (Q766175) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)