加载中…
2014-11-21
An ACCL which is not a CRCL
Colm Ó Dúnlaing
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本