Abstract
We present algorithms for exactly learning unknown environments that can be described by deterministic finite automata. The learner performs a walk on the target automaton, where at each step it observes the output of the state it is at, and chooses a labeled edge to traverse to the next state. The learner has no means of a reset, and does not have access to a teacher that answers equivalence queries and gives the learner counterexamples to its hypotheses. We present two algorithms: The first is for the case in which the outputs observed by the learner are always correct, and the second is for the case in which the outputs might be corrupted by random noise. The running times of both algorithms are polynomial in the cover time of the underlying graph of the target automaton.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aleliunas, R., & Karp, R. M., & Lipton, R. J., & Lovász, L., & Rackoff, C. (1979). Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the Twentieth Annual Symposium on Foundations of Computer Science (pp. 218-223).
Angluin D. (1981). A note on the number of queries needed to identify regular languages. Information and Control, 51,76-87.
Angluin D. (1987). Learning regular sets from queries and counter examples. Information and Computation, 75,87-106.
Angluin D. (1990). Negative results for equivalence queries. Machine Learning, 5,121-150.
Angluin, D., & and Laird, P. (1988). Learning from noisy examples. Machine Learning, 2,343-370.
Angluin. D., & Smith, C. H. (1983). Inductive inference: Theory and methods. Computing Surveys, 15,237-269.
Bender, M., & Slonim, D. (1994). The power of team exploration: Two robots can learn unlabeled directed graphs. In Proceedings of the Thirty Fifth Annual Symposium on Foundations of Computer Science (pp. 75-85).
Bergando, F., & Varricchio, S. (1994). Learning behaviors of automata from multiplicity and equivalnece queries. In Algorithms and complexity, Proceedings of the 2nd Italian conference (pp. 54-62). To appear in Siam J. of Computing.
Dean, T., & Angluin, D., & Basye, K., & Engelson, S., & Kaelbling, L., & Kokkevis, D., & Maron, O. (1995). Inferring finite automata with stochastic output functions and an application to map learning. Machine Learning, 18,81-108.
Ergün, F., & Ravikumar, S., & Rubinfeld, R. (1995). On learning bounded-width branching programs. In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (pp. 361-368).
Fortnow, L., & Whang, D. (1994). Optimality and domination in repeated games with bounded players. In The 25th Annual ACM Symposium on Theory of Computing, (pp. 741-749).
Frazier, M., & Goldman, S., & Mishra, N., & Pitt, L. (1994). Learning from a consistently ignorant teacher. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory (pp. 328-339). To appear in Journal of Computer Systems Science.
Freund, Y., & Kearns, M., & Mansour, Y., & Ron, D., & Rubinfeld, R., & Schapire, R. (1995). Efficient algorithms for learning to play repeated games against computationally bounded adversaries. In Proceedings of the Thirty Seventh Annual Symposium on Foundations of Computer Science (pp 332-341).
Freund, Y., & Kearns, M., & Ron, D., & Rubinfeld, R., & Schapire, R., & Sellie, R. (1993). Efficient learning of typical finite automata from random walks. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (pp. 315-324).
Gilboa, I., & and Samet, D. (1989). Bounded versus unbounded rationality: The tyranny of the weak. Games and Economic Behavior, 1,213-221.
Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58,13-30.
Ibarra, O., & Jiang, T. (1988). Learning regular languaages from counterexamples. In Proceedings of the 1988 Workshop on Computational Learning Theory, (pp. 371-385).
Kearns, M. & Valiant, L. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the Association for Computing Machinery, 41,67-95.
Kohavi, Z. (1978). Switching and Finite Automata Theory. McGraw-Hill, second edition.
Li, M., & Vazirani, U. (1988). On the learnability of finite automata. In Proceedings of the 1988 Workshop on Computational Learning Theory, (pp. 359-370).
Motwani, R., & Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press, first edition.
Rivest, R., & Schapire, R. (1993). Inference of finite automata using homing sequences. Information and Computation, 103,299-347.
Rivest, R., & Schapire, R. (1994). Diversity-based inference of finite automata. Journal of the Association for Computing Machinery, 43,555-589.
Rivest, R., & Zuckermann, D. (1992). Private communication.
Ron, D., & Rubinfeld, R. (1995). Learning fallible finite state automata. Machine Learning, 18,149-185.
Sakakibara, Y. (1991). On learning from queries and couterexamples in the presence of noise. Information Processing Letters, 37,279-284.
Schapire, R., & Warmuth, M. (1990). Presented at COLT90 rump session, 1990.
Sinclair, A., & Jerrum, M. (1989) Approximate counting, uniform generation, and rapidly mixing Markov chains. Information and Computation, 82,93-13.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ron, D., Rubinfeld, R. Exactly Learning Automata of Small Cover Time. Machine Learning 27, 69–96 (1997). https://doi.org/10.1023/A:1007348927491
Issue Date:
DOI: https://doi.org/10.1023/A:1007348927491