Learning finite-state machines from inexperienced teachers

Authors:
Olga Grinchtein;Martin Leucker
Affiliations:
Department of Computer Systems, Uppsala University, Sweden;Institut für Informatik, TU München, Germany
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 3
Cited 0

Learning regular sets from queries and counterexamples

Information and Computation
Efficient Algorithms for the Inference of Minimum Size DFAs

Machine Learning
On the Synthesis of Finite-State Machines from Samples of Their Behavior

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The general goal of query-based learning algorithms for finite-state machines is to identify a machine, usually of minimum size, that agrees with an a priori fixed (class of) machines. For this, queries on how the underlying system behaves may be issued.