A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems

Colm Ó Dúnlaing, Natalie Schluter. A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems. Theoretical Computer Science, 411(3):677-690, 2010. [doi]

@article{ODunlaingS10,
  title = {A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems},
  author = {Colm Ó Dúnlaing and Natalie Schluter},
  year = {2010},
  doi = {10.1016/j.tcs.2009.10.003},
  url = {http://dx.doi.org/10.1016/j.tcs.2009.10.003},
  researchr = {https://researchr.org/publication/ODunlaingS10},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {411},
  number = {3},
  pages = {677-690},
}