关于Jurdzinski和Lorys关于回文不是Church-Rosser语言的证明
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
摘要:
2002年,Jurdzinski和Lorys解决了一个长期存在的猜想,即回文不是Church-Rosser语言。他们的证明需要一个复杂的理论,关于计算图的2栈自动机。我们给出了他们在1-tape图灵机上的证明,并给出了Buntrock和Otto关于非方位串的上下文无关集合不是Church-Rosser的结果的另一种证明.
英文摘要:
In 2002 Jurdzinski and Lorys settled a long-standing conjecture that palindromes are not a Church-Rosser language. Their proof required a sophisticated theory about computation graphs of 2-stack automata. We present their proof in terms of 1-tape Turing machines.We also provide an alternative proof of Buntrock and Otto's result that the set of non-square bitstrings, which is context-free, is not Church-Rosser.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。