University Of Tasmania
AWOCA06-Plant_Science.pdf (204.43 kB)

Labeled directed graphs and FSA as classifiers of strings

Download (204.43 kB)
conference contribution
posted on 2023-05-26, 07:21 authored by Kelarev, A, Kang, BH, Sale, AHJ, Williams, R
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


Publication status

  • Published

Event title

17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006)

Event Venue

Uluru, Australia

Date of Event (Start Date)


Date of Event (End Date)


Repository Status

  • Open

Usage metrics

    University Of Tasmania


    No categories selected