Labelled Cayley graphs and minimal automata

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

Preview

PDF - Requires a PDF viewer
96Kb

Abstract

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
ID Code:	173
Deposited By:	utas eprints
Deposited On:	29 Apr 2005
Last Modified:	18 Jul 2008 19:39
ePrint Statistics:	View statistics for this ePrint

Repository Staff Only: item control page