Decidability for left-linear growing term rewriting systems
From MaRDI portal
Recommendations
Cited in
(16)- Strong and NV-sequentiality of constructor systems
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Decidability for left-linear growing term rewriting systems.
- A property of left-linear rewrite systems preserving recognizability
- Context-sensitive rewriting strategies
- Right-linear half-monadic term rewrite systems
- Just-in-time: on strategy annotations
- Some undecidable approximations of TRSs
- Correct and complete (positive) strategy annotations for \textsf{OBJ}
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- Decidable approximations of term rewriting systems
- Closure of tree automata languages under innermost rewriting
- Decidable call by need computations in term rewriting (extended abstract)
- scientific article; zbMATH DE number 6792369 (Why is no real title available?)
- Termination criteria for tree automata completion
- Murg term rewrite systems
This page was built for publication: Decidability for left-linear growing term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938609)