An ACCL which is not a CRCL
Logic in Computer Science
2014-12-03 v2
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.
Cite
@article{arxiv.1411.5853,
title = {An ACCL which is not a CRCL},
author = {Colm Ó Dúnlaing},
journal= {arXiv preprint arXiv:1411.5853},
year = {2014}
}