Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
From MaRDI portal
Publication:3522018
DOI10.1007/978-3-540-70590-1_13zbMATH Open1145.68449OpenAlexW1819637175MaRDI QIDQ3522018FDOQ3522018
Masahiko Sakai, Yoshiharu Kojima
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_13
Recommendations
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
- [[:Publication:3780429|Title not available (Why is that?)]]
- [[:Publication:4938609|Title not available (Why is that?)]]
- Decidability of reachability for disjoint union of term rewriting systems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidable approximations of term rewriting systems
- The Confluence Problem for Flat TRSs
- Title not available (Why is that?)
- Encompassment properties and automata with constraints
- Reachability and confluence are undecidable for flat term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bottom-Up Rewriting Is Inverse Recognizability Preserving
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
Cited In (4)
This page was built for publication: Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522018)
