Pages that link to "Item:Q1325846"
From MaRDI portal
The following pages link to Decidability of reachability for disjoint union of term rewriting systems (Q1325846):
Displaying 8 items.
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Homomorphism theorem and unreachability for \(\omega\) rewriting systems (Q2725956) (← links)
- Decidability of termination of grid string rewriting rules (Q2784496) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)