Open Access Repository

Labelled Cayley graphs and minimal automata

Kelarev, A 2004 , 'Labelled Cayley graphs and minimal automata' , Australasian J. Combinatorics, vol. 30 , pp. 95-101 .

cayley_min.pdf | Download (99kB)
Available under University of Tasmania Standard License.

| Preview


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.

Item Type: Article
Authors/Creators:Kelarev, A
Keywords: language classifiers, Cayley graphs, recognisers, recognizers, states
Journal or Publication Title: Australasian J. Combinatorics
Item Statistics: View statistics for this item

Actions (login required)

Item Control Page Item Control Page