1 paper · 1 filter
Pranshu Gaba, Arnab Sur
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite…