Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Learning Theory

ALT 2003: Algorithmic Learning Theory pp 129–143Cite as

On the Learnability of Erasing Pattern Languages in the Query Model

  • Conference paper

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

Abstract

A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possibly empty) strings of constant symbols for the variables in p.

The present paper deals with the problem of learning the erasing pattern languages and natural subclasses thereof within Angluin’s model of learning with queries. The paper extends former studies along this line of research. It provides new results concerning the principal learning capabilities of query learners as well as the power and limitations of polynomial-time query learners.

In addition, the paper focusses on a quite natural extension of Angluin’s original model. In this extended model, the query learner is allowed to query languages which are themselves not object of learning. Query learners of the latter type are often more powerful and more efficient than standard query learners. Moreover, when studying this new model in a more general context, interesting relations to Gold’s model of language learning from only positive data have been elaborated.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)

    Google Scholar 

  4. Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 12–31. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., Shinohara, T.: A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Computing 11, 361–375 (1993)

    Article  MATH  Google Scholar 

  6. Erlebach, T., Rossmanith, P., Stadtherr, H., Steger, A., Zeugmann, T.: Learning onevariable pattern languages very efficiently on average, in parallel, and by asking questions. In: Proc. Int. Conf. on Algorithmic Learning Theory. LNCS (LNAI), vol. 1316, pp. 260–276. Springer, Heidelberg (1997)

    Google Scholar 

  7. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)

    MATH  Google Scholar 

  9. Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. Journal of Computer and System Sciences 50, 53–63 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: Proc. ACM Workshop on Computational Learning Theory, pp. 377–390. ACM Press, New York (1992)

    Chapter  Google Scholar 

  11. Matsumoto, S., Shinohara, A.: Learning pattern languages using queries. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS, vol. 1208, pp. 185–197. Springer, Heidelberg (1997)

    Google Scholar 

  12. Mitchell, A.: Learnability of a subclass of extended pattern languages. In: Proc. ACM Workshop on Computational Learning Theory, pp. 64–71. ACM-Press, New York (1998)

    Google Scholar 

  13. Nessel, J., Lange, S.: Learning erasing pattern languages with queries. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol. 1968, pp. 86–100. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Reidenbach, D.: A negative result on inductive inference of extended pattern languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 308–320. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

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

    Google Scholar 

  16. Salomaa: Return to patterns (the formal language theory column). EATCS Bulletin 55, 144–157 (1995)

    MATH  Google Scholar 

  17. Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)

    Google Scholar 

  18. Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Zeugmann, T., Lange, S. (eds.) Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol. 961, pp. 190–258. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, 66123, Saarbrücken, Germany

    Steffen Lange

  2. FB Informatik, Universität Kaiserslautern, Postfach 3049, 67653, Kaiserslautern, Germany

    Sandra Zilles

Authors
  1. Steffen Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandra Zilles
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    Ricard Gavaldá

  2. Meme Media Laboratory, Hokkaido University Sapporo, Kita 13, Nishi 8, Kita-ku, 060-8628, Sapporo, Japan

    Klaus P. Jantke

  3.  ,  

    Eiji Takimoto

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, S., Zilles, S. (2003). On the Learnability of Erasing Pattern Languages in the Query Model. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds) Algorithmic Learning Theory. ALT 2003. Lecture Notes in Computer Science(), vol 2842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39624-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39624-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20291-2

  • Online ISBN: 978-3-540-39624-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation