Labeled directed graphs and FSA as classifiers of strings

Kelarev, Andrei and Kang, Byeong Ho and Sale, Arthur and Williams, Raymond (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.

Preview

PDF - Requires a PDF viewer
204Kb

Abstract

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)
Subjects:	280000 Information, Computing and Communication Sciences > 280200 Artificial Intelligence and Signal and Image Processing > 280201 Expert Systems 280000 Information, Computing and Communication Sciences > 280200 Artificial Intelligence and Signal and Image Processing > 280207 Pattern Recognition
ID Code:	722
Deposited By:	Dr Byeong Ho Kang
Deposited On:	08 Feb 2007
Last Modified:	09 Jan 2008 02:30
ePrint Statistics:	View statistics for this ePrint

Repository Staff Only: item control page