2000 character limit reached
An ACCL which is not a CRCL (1411.5853v2)
Published 21 Nov 2014 in cs.LO
Abstract: It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known that every regular set is a Church-Rosser congruential language (CRCL). Whether there exists an ACCL, which is not a CRCL, seems to remain an open question. In this note we present one such ACCL.