Pages that link to "Item:Q1082092"
From MaRDI portal
The following pages link to Reductions in tree replacement systems (Q1082092):
Displaying 21 items.
- CHAP and rewrite components (Q766175) (← links)
- Attacking a public key cryptosystem based on tree replacement (Q858300) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← 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 of reachability for disjoint union of term rewriting systems (Q1325846) (← 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)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Inductive proofs by specification transformations (Q5055713) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
- Computing linearizations using test sets (Q5881192) (← links)
