Open Access Repository

Labeled directed graphs and FSA as classifiers of strings


Downloads per month over past year

Kelarev, A, Kang, BH, Sale, AHJ and Williams, R 2006 , 'Labeled directed graphs and FSA as classifiers of strings', paper presented at the 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006), 13-16 Jul 2006, Uluru, Australia.

AWOCA06-Plant_S...pdf | Download (209kB)
Available under University of Tasmania Standard License.

| Preview


The classical concept of a finite state automaton (FSA) has long been used in computer science to classify formal languages regarded as sets of strings. This paper surveys and unifies recent results on strings recognized by FSA defined by labeled directed graphs, and highlights several interesting open questions. In particular, one of our open questions deals with a new method of applying a related construction to classification

Item Type: Conference or Workshop Item (Paper)
Authors/Creators:Kelarev, A and Kang, BH and Sale, AHJ and Williams, R
Item Statistics: View statistics for this item

Actions (login required)

Item Control Page Item Control Page