Abstract
We propose abstract observation tables, an abstract data type for learning deterministic weighted tree automata in Angluin’s minimal adequate teacher (MAT) model, and show that every correct implementation of abstract observation tables yields a correct MAT learner. Besides the “classical” observation table, we show that abstract observation tables can also be implemented by observation trees. The advantage of the latter is that they often require fewer queries to the teacher.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Angluin D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
Angluin D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1987)
Angluin, D.: Queries revisited. In: Proceedings of 12th International Conference Algorithmic Learning Theory, volume 2225 of LNCS, pp. 12–31. Springer (2001)
Berstel J., Reutenauer C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18(2), 115–148 (1982)
Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: Proceedings of 7th International Confernce Developments in Language Theory, volume 2710 of LNCS, pp. 146–158. Springer (2003)
Borchardt B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybernet. 16(4), 509–544 (2004)
Borchardt, B.: The theory of recognizable tree series. PhD thesis, Technische Universität Dresden (2005)
Cortes C., Mohri M., Rastogi A.: L p distance and equivalence of probabilistic automata. J. Comput. Syst. Sci. 18(4), 761–779 (2007)
de la Higuera, C., Oncina, J.: Learning stochastic finite automata. In: Proceedings of 7th International Colloquium on Grammatical Inference, volume 3264 of LNCS, pp. 175–186. Springer (2004)
Drewes F.: MAT learners for recognizable tree languages and tree series. Acta Cybernet. 19(2), 249–274 (2009)
Drewes, F., Högberg, J.: Extensions of a MAT learner for regular tree languages. In: Proceedings of 23rd Annual Workshop of the Swedish Artificial Intelligence Society, pp. 35–44 (2006)
Drewes F., Högberg J.: Query learning of regular tree languages: how to avoid dead states. Theory Comput. Syst. 40(2), 163–185 (2007)
Drewes F., Vogler H.: Learning deterministically recognizable tree series. J. Automat. Lang. Combinat. 12(3), 332–354 (2007)
Fülöp Z., Vogler H.: Weighted tree automata and tree transducers. In: Kuich, W., Droste, M., Vogler, H. (eds) Handbook of Weighted Automata, chapter 9, pp. 313–403. Springer, Berlin (2009)
Golan J.S.: Semirings and Their Applications. Kluwer Academic, Dordrecht (1999)
Gold E.M.: Language identification in the limit. Inf. Cont. 10(5), 447–474 (1967)
Habrard, A., Oncina, J.: Learning multiplicity tree automata. In: Proceedings of 8th International Colloquium on Grammatical Inference, volume 4201 of LNCS, pp. 268–280. Springer (2006)
Kearns M.J., Vazirani U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
Maletti, A.: Learning deterministically recognizable tree series—revisited. In: Proceedings of 2nd International Conference on Algebraic Informatics, volume 4728 of LNCS, pp. 218–235. Springer (2007)
Oncina, J.: Using multiplicity automata to identify transducer relations from membership and equivalence queries. In: Proceedings of 9th International Colloquium on Grammatical Inference, volume 5278 of LNCS, pp. 154–162. Springer (2008)
Sakakibara Y.: Learning context-free grammars from structural data in polynomial time. Theoret. Comput. Sci. 76(2–3), 223–242 (1990)
Shapiro E.Y.: Algorithmic Program Debugging. ACM Distinguished Dissertation. MIT Press, Cambridge (1983)
Valiant L.G.: A theory of the learnable. Commun. ACM 27(11), 1134–1142 (1984)
Author information
Authors and Affiliations
Corresponding author
Additional information
Andreas Maletti is supported by the Ministerio de Educación y Ciencia (MEC) grant JDCI-2007-760.
Rights and permissions
About this article
Cite this article
Drewes, F., Högberg, J. & Maletti, A. MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48, 165–189 (2011). https://doi.org/10.1007/s00236-011-0135-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-011-0135-x