Pages that link to "Item:Q1127543"
From MaRDI portal
The following pages link to Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543):
Displayed 9 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Losing recognizability (Q2373716) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)