Undecidable Properties on Length-Two String Rewriting Systems
From MaRDI portal
Publication:2873677
DOI10.1016/j.entcs.2008.03.053zbMath1279.68118MaRDI QIDQ2873677
Publication date: 24 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.053
confluence; rewriting system; left-most termination; length-two string rewriting system; right-most termination
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability and confluence are undecidable for flat term rewriting systems
- The Church-Rosser property for ground term-rewriting systems is decidable
- Simulation of Turing machines by a regular rewrite rule
- Termination of term rewriting: Interpretation and type elimination
- Decision problems for semi-Thue systems with a few rules
- Relative undecidability in term rewriting. I: The termination hierarchy
- Relative undecidability in term rewriting. II: The confluence hierarchy
- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
- The Confluence Problem for Flat TRSs
- Computer Science Logic
- Automated Deduction – CADE-20
- A variant of a recursively unsolvable problem