Decidable approximations of term rewriting systems
From MaRDI portal
Recommendations
Cites work
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4043235 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1380887 (Why is no real title available?)
- scientific article; zbMATH DE number 1380890 (Why is no real title available?)
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Recursive unsolvability of a problem of Thue
- Reductions in tree replacement systems
- Sequentiality in orthogonal term rewriting systems
- Simulation of Turing machines by a left-linear rewrite rule
Cited in
(28)- Strong and NV-sequentiality of constructor systems
- Decidability for left-linear growing term rewriting systems.
- Decidable call-by-need computations in term rewriting
- Derivation trees of ground term rewriting systems.
- The combinator S
- Some decidability results on one-pass reductions
- Tree automata for rewrite strategies
- Decidability of termination of grid string rewriting rules
- Some undecidable approximations of TRSs
- Root-neededness and approximations of neededness
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- scientific article; zbMATH DE number 4043235 (Why is no real title available?)
- scientific article; zbMATH DE number 1405630 (Why is no real title available?)
- Handling left-quadratic rules when completing tree automata
- Completeness of tree automata completion
- Closure of tree automata languages under innermost rewriting
- Decidable call by need computations in term rewriting (extended abstract)
- Soft typing for ordered resolution
- On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting
- Levels of undecidability in rewriting
- Approximately satisfied properties of systems and simple language homomorphisms
- Ground approximations of term rewriting systems
- Termination criteria for tree automata completion
- Bottom-up rewriting for words and terms
- A theoretical limit for safety verification techniques with regular fix-point computations
- Murg term rewrite systems
This page was built for publication: Decidable approximations of term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055873)
