Decidable approximations of term rewriting systems
From MaRDI portal
Publication:5055873
DOI10.1007/3-540-61464-8_65zbMATH Open1503.68117OpenAlexW1551719154MaRDI QIDQ5055873FDOQ5055873
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_65
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25)
Cites Work
- Simulation of Turing machines by a left-linear rewrite rule
- Sequentiality in orthogonal term rewriting systems
- Title not available (Why is that?)
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive Unsolvability of a problem of Thue
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reductions in tree replacement systems
Cited In (26)
- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
- Decidable call-by-need computations in term rewriting
- The combinator S
- Derivation trees of ground term rewriting systems.
- Title not available (Why is that?)
- Decidability of termination of grid string rewriting rules
- A theoretical limit for safety verification techniques with regular fix-point computations
- Title not available (Why is that?)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
- Title not available (Why is that?)
- Closure of Tree Automata Languages under Innermost Rewriting
- Decidable call by need computations in term rewriting (extended abstract)
- Root-neededness and approximations of neededness
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting
- Bottom-up rewriting for words and terms
- Strong and NV-sequentiality of constructor systems
- Levels of undecidability in rewriting
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- Tree automata for rewrite strategies
- Termination criteria for tree automata completion
- Decidability for left-linear growing term rewriting systems.
- Murg term rewrite systems
- Soft typing for ordered resolution
- Some decidability results on one-pass reductions
- Handling Left-Quadratic Rules When Completing Tree Automata
- Approximately satisfied properties of systems and simple language homomorphisms
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)
