AWOCA06-Plant_Science.pdf (204.43 kB)
Download fileLabeled directed graphs and FSA as classifiers of strings
conference contribution
posted on 2023-05-26, 07:21 authored by Kelarev, A, Kang, BH, Sale, AHJ, Williams, RThe 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
History
Publication status
- Published
Event title
17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006)Event Venue
Uluru, AustraliaDate of Event (Start Date)
2006-07-13Date of Event (End Date)
2006-07-16Repository Status
- Open
