The following pages link to (Q4035665):
Displayed 10 items.
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Undecidable properties of deterministic top-down tree transducers (Q1341717) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Losing recognizability (Q2373716) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Open problems in rewriting (Q5055780) (← links)
- More problems in rewriting (Q5055812) (← links)