Library Open Repository

Labelled Cayley graphs and minimal automata


Downloads per month over past year

Kelarev, A (2004) Labelled Cayley graphs and minimal automata. Australasian J. Combinatorics, 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
Keywords: language classifiers, Cayley graphs, recognisers, recognizers, states
Journal or Publication Title: Australasian J. Combinatorics
Page Range: pp. 95-101
Date Deposited: 29 Apr 2005
Last Modified: 18 Nov 2014 03:10
Item Statistics: View statistics for this item

Actions (login required)

Item Control Page Item Control Page