By Topic

Inference of regular languages using model simplicity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)

We describe an approach that is related to a number of existing algorithms for the inference of a regular language from a set of positive (and optionally also negative) examples. Variations on this approach provide a family of algorithms that attempt to minimise the complexity of a description of the example data in terms of a finite state automaton model. Experiments using a standard set of small problems show that this approach produces satisfactory results when positive examples only are given, and can be helpful when only a limited number of negative examples is available. The results also suggest that improved algorithms will be needed in order to tackle more challenging problems, such as data mining and exploratory sequential analysis applications

Published in:

Computer Science Conference, 2001. ACSC 2001. Proceedings. 24th Australasian

Date of Conference:

2001