Skip to main content
SpringerLink
Log in

Learning Erasing Pattern Languages with Queries

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 2000)

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

Included in the following conference series:

Abstract

A pattern is a finite string of constant and variable symbols. The non-erasing language generated by a pattern is the set of all strings of constant symbols that can be obtained by substituting non-empty strings for variables. In order to build the erasing language generated by a pattern, it is also admissible to substitute the empty string.

The present paper deals with the problem of learning erasing pattern languages within Angluin’s model of learning with queries. Moreover, the learnability of erasing pattern languages with queries is studied when additional information is available. The results obtained are compared with previously known results concerning the case that non-erasing pattern languages have to be learned.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D. (1980), Finding pattern common to a set of strings, Journal of Computer and System Sciences 21, 46–62. 86, 87, 88

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, 117–135.

    Article  MATH  MathSciNet  Google Scholar 

  3. Angluin, D. (1988), Queries and concept learning, Machine Learning 2, 319–342. 86, 87, 88, 89, 90, 92, 98

    Google Scholar 

  4. Erlebach, T., Rossmanith, P., Stadtherr, H., Steger, A., Zeugmann, T. (1997), Learning one-variable pattern languages very efficiently on average, in parallel, and by asking questions, In: Proc. Int. Conference on Algorithmic Learning Theory (ALT’97), Lecture Notes in Artificial Intelligence 1316, pages 260–276, Springer-Verlag. 87

    Google Scholar 

  5. Gold, M. (1967), Language identification in the limit, Information and Control 10, 447–474. 86, 87

    Article  MATH  Google Scholar 

  6. Hopcroft, J. E., Ullman J. D. (1979), Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company. 88, 96

    Google Scholar 

  7. Jiang, T., Salomaa, A., Salomaa, K., Yu, S. (1995), Decision problems for patterns, Journal of Computer and System Sciences 50, 53–63. 86, 89, 95, 96

    Article  MATH  MathSciNet  Google Scholar 

  8. Kearns, M., Pitt, L. (1989), A polynomial-time algorithm for learning k-variable pattern languages from examples, In: Proc. Workshop on Computational Learning Theory (COLT’89), pages 57–71, Morgan Kaufmann Publ. 86

    Google Scholar 

  9. Lange, S., Wiehagen, R. (1991), Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8, 361–370. 86, 87

    Article  MATH  Google Scholar 

  10. Marron, A., Ko, K. (1987), Identification of pattern languages from examples and queries, Information and Computation 74, 91–112. 86

    Article  MATH  MathSciNet  Google Scholar 

  11. Marron, A. (1988), Learning pattern languages from a single initial example and from queries, In: Proc. Workshop on Computational Learning Theory (COLT’88), pages 1–23, Morgan Kaufmann Publ. 87

    Google Scholar 

  12. Matsumoto, S., Shinohara, A. (1997), Learning pattern languages using queries, In: Proc. European Conference on Computational Learning Theory (EuroCOLT’97), Lecture Notes in Artificial Intelligence 1208, pages 185–197, Springer Verlag. 87, 88, 94

    Google Scholar 

  13. Mitchell, A. (1998), Learnability of a subclass of extended pattern languages, In: Proc. ACM Workshop on Computational Learning Theory (COLT’98), pages 64–71, ACM-Press. 86

    Google Scholar 

  14. Nix, R. P. (1983), Editing by examples, PhD Thesis, Technical Report 280, Yale University, Dept. Computer Science. 86

    Google Scholar 

  15. Salomaa, A. (1994), Patterns (the formal language theory column), EATCS Bulletin 54, 46–62. 86, 89

    Google Scholar 

  16. Salomaa, A. (1994), Return to patterns (the formal language theory column), EATCS Bulletin 55, 144–157. 86, 89

    Google Scholar 

  17. Shinohara, T. (1983), Polynomial-time inference of extended regular pattern languages, In: Proc. RIMS Symposia on Software Science and Engineering, Lecture Notes in Computer Science 147, pages 115–127, Springer-Verlag. 86

    Google Scholar 

  18. Shinohara, T., Arikawa, S. (1995), Pattern inference, In: Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence 961, pages 259–291, Springer-Verlag. 86

    Google Scholar 

  19. Rogers, H. Jr. (1987), Theory of Recursive Functions and Effective Computability, MIT Press. 88

    Google Scholar 

  20. Valiant, L. G. (1984), A theory of the learnable, Communications of the ACM 27, 1134–1142. 86

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Kaiserslautern, Fachbereich Informatik, Postfach 3049, 67653, Kaiserslautern, Germany

    Jochen Nessel

  2. Universität Leipzig, Institut für Informatik, Augustusplatz 10-11, 04109, Leipzig, Germany

    Steffen Lange

Authors
  1. Jochen Nessel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steffen Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Hakozaki 6-10-1, 812-8581, Fukuoka, Japan

    Hiroki Arimura

  2. School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore, Singapore

    Sanjay Jain

  3. School of Computer Science and Engineering, The University of New South Wales, 2052, Sydney, Australia

    Arun Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nessel, J., Lange, S. (2000). Learning Erasing Pattern Languages with Queries. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-40992-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41237-3

  • Online ISBN: 978-3-540-40992-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation