Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Grammatical Inference

ICGI 2004: Grammatical Inference: Algorithms and Applications pp 288–289Cite as

An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries

  • Conference paper

  • 353 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3264))

Abstract

We consider a PAC learning problem of simple deterministic languages and show sufficient conditions of it.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Angluin, D.: A note on the number of queries needed to identify regular languages. Inf. & Cont. 51, 76–87 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Learning regular languages from queries and counterexamples. Inf. & Comp. 75, 87–106 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning 5, 151–164 (1990)

    Google Scholar 

  4. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer, Information and Communication Sciences, Tokyo University of Agriculture and Technology, naka-chou 2-24-16, koganei, Tokyo, 184-8588, Japan

    Yasuhiro Tajima, Yoshiyuki Kotani & Matsuaki Terada

Authors
  1. Yasuhiro Tajima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiyuki Kotani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matsuaki Terada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics and Telecommunications, National Centre for Scientific Research “Demokritos”, Athens, Greece

    Georgios Paliouras

  2. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation