Undecidable properties of flat term rewrite systems
From MaRDI portal
Publication:734041
DOI10.1007/S00200-009-0097-1zbMATH Open1187.68274OpenAlexW2095909184MaRDI QIDQ734041FDOQ734041
Publication date: 19 October 2009
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-009-0097-1
Recommendations
- Reachability and confluence are undecidable for flat term rewriting systems
- New Undecidability Results for Properties of Term Rewrite Systems
- Undecidable properties on length-two string rewriting systems
- scientific article; zbMATH DE number 1086665
- Degrees of Undecidability in Term Rewriting
- The undecidability of self-embedding for term rewriting systems
- Relative undecidability in term rewriting. I: The termination hierarchy
- Total termination of term rewriting is undecidable
- scientific article
- Undecidable properties of deterministic top-down tree transducers
Cites Work
- Title not available (Why is that?)
- Term Rewriting and All That
- The Confluence Problem for Flat TRSs
- Computer Science Logic
- Title not available (Why is that?)
- Reachability and confluence are undecidable for flat term rewriting systems
- Decidability for left-linear growing term rewriting systems.
- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
- On the Normalization and Unique Normalization Properties of Term Rewrite Systems
- Title not available (Why is that?)
- Automated Reasoning
- Termination of Rewriting with Right-Flat Rules
Cited In (3)
This page was built for publication: Undecidable properties of flat term rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734041)
