1 citations · 1 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2014★ 1 cited
An ACCL which is not a CRCL
Colm Ó Dúnlaing
It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known that every regular set is a Church-Rosser congruential languag…
cs.LO2007
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
Colm O. Dunlaing, Natalie Schluter
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 gra…