Library Open Repository
Labeled directed graphs and FSA as classifiers of strings
Kelarev, A and Kang, BH and Sale, AHJ and Williams, R (2006) Labeled directed graphs and FSA as classifiers of strings. In: 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.
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)|
|Date Deposited:||08 Feb 2007|
|Last Modified:||18 Nov 2014 03:13|
|Item Statistics:||View statistics for this item|
Actions (login required)
|Item Control Page|