Abstract
We show a probabilistic learnability of a subclass of linear languages with queries. Learning via queries is an important problem in grammatical inference but the power of queries to probabilistic learnability is not clear yet. In probabilistic learning model, PAC (Probably Approximately Correct) criterion is an important one and many results have been shown in this model. Angluin has shown the ability of replacement from equivalence queries to random examples in PAC criterion but there are also many hardness results. We have shown that the class of simple deterministic languages is polynomial time learnable from membership queries and a representative sample. Also, we have shown that a representative sample can be constructed from polynomial number of random examples with the confidence probability. In this paper, we newly define a subclass of linear languages called strict deterministic linear languages and show the probabilistic learnability with membership queries in polynomial time. This learnability is derived from an exact learning algorithm for this subclass with membership queries, equivalence queries and a representative sample.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Angluin, D.: A note on the number of queries needed to identify regular languages. Info. & Contl. 51, 76–87 (1981)
Angluin, D.: Learning regular sets from queries and counterexamples. Info. & Comp. 75, 87–106 (1987)
Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. J. of Machine Learning Research 5, 473–497 (2004)
Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. J. of Comp. & Sys. Sci. 52, 255–267 (1996)
Harrison, M.A.: Introduction to formal language theory. Addison-Wesley, Reading (1978)
de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)
de la Higuera, C., Oncina, J.: Inferring deterministic linear languages. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 185–200. Springer, Heidelberg (2002)
Tajima, Y., Tomita, E., Wakatsuki, M., Terada, M.: Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comp. Sci. 329, 203–221 (2004)
Takada, Y.: A hierarchy of language families learnable by regular language learning. Info. & Comp. 123, 138–145 (1995)
Valiant, L.G.: A theory of the learnable. Comm. of the ACM 27, 1134–1142 (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tajima, Y., Kotani, Y. (2008). Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)