Pages that link to "Item:Q3979263"
From MaRDI portal
The following pages link to Proofs and reachability problem for ground rewrite systems (Q3979263):
Displaying 5 items.
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Reachability problems on regular ground tree rewriting graphs (Q2432538) (← links)
- Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)