Pages that link to "Item:Q1127543"
From MaRDI portal
The following pages link to Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543):
Displaying 15 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
- Murg term rewrite systems (Q975468) (← 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)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Losing recognizability (Q2373716) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
