正则语言是Church-Rosser同余的
Regular Languages are Church-Rosser Congruential
摘要:
本文证明了形式语言理论中一个由来已久的猜想。证明了所有的正则语言都是Church-Rosser同余的。丘奇-罗瑟同余语言是由麦克诺顿、纳伦德朗和奥托在1988年提出的。一个语言L是Church-Rosser同余的,如果存在一个有限的合流且长度缩减的半图厄系统S,使得L是模S的同余类的有限并。众所周知,有确定性的线性上下文无关语言不是丘奇-罗瑟同余的,但另一方面,人们强烈认为所有的正则语言都是这种形式。实际上,本文证明了一个更一般的结果。
英文摘要:
This paper proves a long standing conjecture in formal language theory. It shows that all regular languages are Church-Rosser congruential. The class of Church-Rosser congruential languages was introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential, if there exists a finite confluent, and length-reducing semi-Thue system S such that L is a finite union of congruence classes modulo S. It was known that there are deterministic linear context-free languages which are not Church-Rosser congruential, but on the other hand it was strongly believed that all regular language are of this form. Actually, this paper proves a more general result.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。