Abstract
In this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what is going on and what the differences between the various algorithms mean. We also include the comparative analysis of the algorithms, review some known lower bounds, prove a new one, and discuss the question of parallelizing this sort of algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Àlvarez, J.L. Balcázar, and B. Jenner, “Adaptive logspace reducibility and parallel time”, Mathematical Systems Theory, Vol. 28, 1995, 117–140.
D. Angluin, “Learning regular sets from queries and counterexamples”, Information and Computation, Vol. 75, 1987, 87–106.
D. Angluin, “Queries and concept learning”, Machine Learning, Vol. 2, 1988, 319–342.
D. Angluin, “Negative results for equivalence queries”, Machine Learning, Vol. 5, 1990, 121–150.
J.L. Balcázar, R.V. Book, and U. Schöning, “On bounded query machines”, Theoretical Computer Science, Vol. 40, 1985, 237–243
J.L. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe, “The query complexity of learning DFA”, New Generation Computing, Vol. 12, 1994, 337–358
Preliminary version in Proc. Third Workshop on Algorithmic Learning Theory, Japanese Society for Artificial Intelligence, 1992, 53–62.
J.L. Balcázar, J. Díaz, R. Gavaldà, and 0. Watanabe: “An optimal parallel algorithm for learning DFA”. in Proc. 7th Annual ACM Conference on Computational Learning Theory, ACM Press, 1994, 208–217.
N.H. Bshouty and R. Cleve, “On the exact learning of formulas in parallel”, in Proc. 33rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1992, 513–522.
N.H. Bshouty, S.A. Goldman, T.R. Hancock, and S. Matar, “Asking queries to minimize errors”, in Proc. 6th Annual ACM Conference on Computational Learning Theory, ACM Press, 1993, 41-50.
Final version in Journal of Computer and System Sciences, Vol. 52, 1996, 268–286
J. Díaz and 0. Watanabe, “Simulation of complicated queries by member-ship queries”. 10th ICOT meeting, Tokyo, nov. 1990. Available as Technical Report LSI-90-32, Universitat Politècnica de Catalunya, 1990.
Y. Ishigami and S. Tani, “The VC-dimensions of finite automata with n states”, Proc. 4th Intl. Workshop on Algorithmic Learning Theory, Springer-Verlag Lecture Notes on Artificial Intelligence 744, 328–341.
M.J. Kearns and U.V. Vazirani, An Introduction to Computational Learning Theory, MIT Press, 1994.
L. Pitt, “Inductive inference, DFAs, and computational complexity”., Proc. International Workshop on Analogical and Inductive Inference AII-89, 18– 42., Springer-Verlag Lecture Notes on Artificial Intelligence 397, 1989.
R.L. Rivest and R.E. Schapire, “Inference of finite automata using homing sequences”,, Information and Computation, Vol. 103, 1993. 299–347
D. Ron, Automata Learning and its Applications, Ph. D. Thesis, Hebrew University, 1995.
R.E. Schapire, The Design and Analysis of Efficient Learning Algorithms. MIT Press, 1992
W. Tzeng, “Learning probabilistic automata and Markov chains via queries”, Machine Learning, Vol. 8, 1992, 151–166.
O. Watanabe, “A framework for polynomial time query learnability”, Mathematical Systems Theory, Vol. 27, 1994, 211–229
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
Balcázar, J.L., Díaz, J., Gavaldà, R., Watanabe, O. (1997). Algorithms for Learning Finite Automata from Queries: A Unified View. In: Du, DZ., Ko, KI. (eds) Advances in Algorithms, Languages, and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3394-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3394-4_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3396-8
Online ISBN: 978-1-4613-3394-4
eBook Packages: Springer Book Archive