Pages that link to "Item:Q1118421"
From MaRDI portal
The following pages link to Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421):
Displaying 26 items.
- Rigid tree automata and applications (Q553317) (← links)
- 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)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
- Murg term rewrite systems (Q975468) (← links)
- 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)
- 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)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Unique Normalization for Shallow TRS (Q3636819) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
