A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser

DOI10.1006/inco.2001.2945zbMath1005.68088OpenAlexW1992603771MaRDI QIDQ1854476

Benedetto Intrigila, Stefano Sorgi, Ivano Salvo

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.2945

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• On theories with a combinatorial definition of 'equivalence'
• Fibonacci representations and finite automata
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• An abstract Church-Rosser theorem. II: Applications

This page was built for publication: A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser