On termination of one rule rewrite systems

DOI10.1016/0304-3975(94)00029-8zbMath0938.68687OpenAlexW2040777670MaRDI QIDQ1334676

Pierre Lescanne

Publication date: 25 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00029-8

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Problems in rewriting III ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulation of Turing machines by a regular rewrite rule
• Simple termination is difficult
• Recursive Unsolvability of a problem of Thue

This page was built for publication: On termination of one rule rewrite systems