Efficient Induction of Finite State Automata
Matthew Collins, Jonathan Oliver
This paper introduces a new algorithm for the induction if complex finite state automata from samples of behavior. 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.
Keywords: Induction, finite state automata, FSA, minimum message length, MML.
PDF Link: /papers/97/p99-collins.pdf
AUTHOR = "Matthew Collins
and Jonathan Oliver",
TITLE = "Efficient Induction of Finite State Automata",
BOOKTITLE = "Proceedings of the Thirteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-97)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1997",
PAGES = "99--107"