cayley_min.pdf (96.95 kB)
Labelled Cayley graphs and minimal automata
journal contributionposted on 2023-05-25, 22:30 authored by Kelarev, A
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.
Publication titleAustralasian J. Combinatorics