scientific article; zbMATH DE number 4060699
From MaRDI portal
Publication:3795205
Recommendations
Cited in
(22)- The undecidability of self-embedding for term rewriting systems
- Simulation of Turing machines by a regular rewrite rule
- Simple termination is difficult
- Omega-termination is undecidable for totally terminating term rewriting systems
- The undecidability of the first-order theories of one step rewriting in linear canonical systems
- Total termination of term rewriting is undecidable
- scientific article; zbMATH DE number 1638661 (Why is no real title available?)
- Undecidable properties on length-two string rewriting systems
- One-rule semi-Thue systems with loops of length one, two or three
- scientific article; zbMATH DE number 1183250 (Why is no real title available?)
- scientific article; zbMATH DE number 17534 (Why is no real title available?)
- On confluence of one-rule trace-rewriting systems
- Simulation of Turing machines by a left-linear rewrite rule
- Extensions and comparison of simplification orderings
- Simple termination is difficult
- The first-order theory of one-step rewriting is undecidable
- AC-termination of rewrite systems: a modified Knuth-Bendix ordering
- One-rule trace-rewriting systems and confluence
- Termination and derivational complexity of confluent one-rule string-rewriting systems
- Levels of undecidability in rewriting
- Improving associative path orderings
- Polynomial termination over \(\mathbb{N}\) is undecidable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795205)
