Learning finite automata using label queries

Authors:
Dana Angluin;Leonor Becerra-Bonache;Adrian Horia Dediu;Lev Reyzin
Affiliations:
Department of Computer Science, Yale University, New Haven, CT;Department of Computer Science, Yale University, New Haven, CT and Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain and "Politehnica" University of Bucharest, Bucharest, Romania;Department of Computer Science, Yale University, New Haven, CT
Venue:
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Year:
2009

Citing 6
Cited 0

Efficient learning of typical finite automata from random walks

Information and Computation
Testing Finite-State Machines: State Identification and Verification

IEEE Transactions on Computers
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
On the number of distinct languages accepted by finite automata with n states

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Learning DFA from correction and equivalence queries

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M using labels from a set L. The learner has access to label queries; a label query with input string w returns both the output and the label of the state reached by w. Because different automata may have the same output behavior, we consider the case in which the teacher may "unfold" M to an output equivalent machine M′ and label the states of M′ for the learner. We give lower and upper bounds on the number of label queries to learn the output behavior of M in these different scenarios. We also briefly consider the case of randomly labeled automata with randomly chosen transition functions.