1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
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…