Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

Abstract

This paper first describes the structure and results of the Abbadingo One DFA Learning Competition. The competition was designed to encourage work on algorithms that scale well—both to larger DFAs and to sparser training data. We then describe and discuss the winning algorithm of Rodney Price, which orders state merges according to the amount of evidence in their favor. A second winning algorithm, of Hugues Juillé, will be described in a separate paper.

DOI: 10.1007/BFb0054059

Extracted Key Phrases

3 Figures and Tables

01020'99'01'03'05'07'09'11'13'15'17
Citations per Year

259 Citations

Semantic Scholar estimates that this publication has 259 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Lang1998ResultsOT, title={Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm}, author={Kevin J. Lang and Barak A. Pearlmutter and Rodney A. Price}, booktitle={ICGI}, year={1998} }