Undecidable properties of flat term rewrite systems
From MaRDI portal
(Redirected from Publication:734041)
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
- Publication:4362915
- 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
- Publication:4065053
- Undecidable properties of deterministic top-down tree transducers
Cites work
- scientific article; zbMATH DE number 1615242 (Why is no real title available?)
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 1962804 (Why is no real title available?)
- Automated Reasoning
- Computer Science Logic
- 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
- Reachability and confluence are undecidable for flat term rewriting systems
- Term Rewriting and All That
- Termination of Rewriting with Right-Flat Rules
- The Confluence Problem for Flat TRSs
Cited in
(6)- Unique Normalization for Shallow TRS
- The reachability and related decision problems for monadic and semi-constructor TRSs
- Reachability and confluence are undecidable for flat term rewriting systems
- Uniqueness of normal forms for shallow term rewrite systems
- Normalization properties for shallow TRS and innermost rewriting
- The Confluence Problem for Flat TRSs
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)
