Abstract
We consider a PAC learning problem of simple deterministic languages and show sufficient conditions of it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angluin, D.: A note on the number of queries needed to identify regular languages. Inf. & Cont. 51, 76–87 (1981)
Angluin, D.: Learning regular languages from queries and counterexamples. Inf. & Comp. 75, 87–106 (1987)
Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning 5, 151–164 (1990)
Tajima, Y., Tomita, E.: A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol. 1891, pp. 284–297. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tajima, Y., Kotani, Y., Terada, M. (2004). An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30195-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23410-4
Online ISBN: 978-3-540-30195-0
eBook Packages: Springer Book Archive