ITU

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

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

  • Colm Ó Dúnlaing
  • Natalie Schluter

View graph of relations

Original languageEnglish
JournalTheoretical Computer Science
Volume411
Pages (from-to)677-690
Number of pages14
ISSN0304-3975
Publication statusPublished - 2010
Externally publishedYes

ID: 81567594