Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language

Details Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language

2007-10-24

arxiv.org/abs/0710.4499v2

Computer Science

Logic in Computer Science

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655396