Skip to main content
Conference Proceedings

An analysis of examples and a search space for PAC learning of simple deterministic languages with membership queries

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2004) 3264 288-289
DOI: 10.1007/978-3-540-30195-0_31
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a PAC learning problem of simple deterministic languages and show sufficient conditions of it. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

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 Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3264, pp. 288–289). Springer Verlag. https://doi.org/10.1007/978-3-540-30195-0_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free