Efficient induction of finite state automata

Authors:
Matthew S. Collins;Jonathan J. Oliver
Affiliations:
Computer Science Dept, Monash University, Clayton, Victoria, Australia;Computer Science Dept, Monash University, Clayton, Victoria, Australia
Venue:
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Year:
1997

Citing 6
Cited 0

Learning regular sets from queries and counterexamples

Information and Computation
Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships

Pattern Recognition
The design and analysis of efficient learning algorithms

The design and analysis of efficient learning algorithms
A fully implicit algorithm for exact state minimization

DAC '94 Proceedings of the 31st annual Design Automation Conference
Exact and heuristic algorithms for the minimization of incompletely specified state machines

EURO-DAC '91 Proceedings of the conference on European design automation
On the Synthesis of Finite-State Machines from Samples of Their Behavior

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new algorithm for the induction of complex finite state automata from samples of behaviour. The algorithm is based on information theoretic principles. The algorithm reduces the search space by many orders of magnitude over what was previously thought possible. We compare the algorithm with some existing induction techniques for finite state automata and show that the algorithm is much superior in both run time and quality of inductions.