Labelled Cayley graphs and minimal automata
AV Kelarev · eCite Digital Repository (University of Tasmania) · 2004
Cayley graphs considered as language recognisers are as powerful as the more general finite state automata. This paper applies Cayley graphs to define a class of automata and describe minimal automata of this type, all their congruences and the Nerode equivalence of states.