Skip to main content
SpringerLink
Log in

Polynomial-time inference of arbitrary pattern languages

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

A pattern is a finite string of constants and variables (cf. [1]). The language of a pattern is the set of all strings which can be obtained by substituting non-null strings of constants for the variables of the pattern. In the present paper, we consider the problem of learning pattern languages from examples. As a main result we present an inconsistent polynomial-time algorithm which identifies every pattern language in the limit. Furthermore, we investigate inference of arbitrary pattern languages within the framework of learning from good examples. Finally, we show that every pattern language can be identified in polynomial time from polynomially many disjointness queries, only.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Angluin. Finding Patterns Common to a Set of Strings.J. of Comp. and Syst. Sciences, 21:46–62, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Angluin. Queries and Concept Learning.Machine Learning, 2:319–342, 1988.

    Google Scholar 

  3. D. Angluin and C.H. Smith. A Survey of Inductive Inference: Theory and Methods.Computing Surveys, 15:237–269, 1983.

    Article  MathSciNet  Google Scholar 

  4. L. Blum and M. Blum. Towards a Mathematical Theory of Inductive Inference.Inf. and Control, 28:125–155, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Freivalds, E.B. Kinber, and R. Wiehagen. Inductive Inference from Good Examples. In K. Jantke, editor,Analogical and Inductive Inference 1989, pages 1–17, LNAI 397, Springer-Verlag, 1989.

  6. E.M. Gold. Language Identification in the Limit.Inf. and Control, 10:447–474, 1967.

    Article  MATH  Google Scholar 

  7. R. Klette and R. Wiehagen. Research in the Theory of Inductive Inference by GDR Mathematicians — a Survey.Inf. Sciences, 22:149–169, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Lange. Consistent Polynomial-time Inference ofk-Variable Pattern Languages.Technical Report, Leipzig University of Technology, submitted to theFirst International Workshop on Nonmonotonic and Inductive Logics, Karlsruhe, 1990.

  9. A. Marron. Learning Pattern Languages from a Single Initial Example and from Queries. In D. Haussler and L. Pitt, editors,COLT ’88, pages 345–358, Morgan Kaufmann Publ., 1988.

  10. T. Shinohara. Polynomial-time Inference of Extended Regular Pattern Languages. In E. Goto, K. Furukawa, R. Nakajima, I. Nakata, and A. Yonezawa, editors,RIMS Symp. on Software Sci. and Engin., pages 115–127, LNCS 147, Springer-Verlag, 1983.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, Leipzig University of Technology, P.O. Box 66, 7030, Leipzig, Germany

    Steffen Lange

  2. Department of Informatics, Humboldt University Berlin, P.O. Box 1297, 1086, Berlin, Germany

    Rolf Wiehagen

Authors
  1. Steffen Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Wiehagen
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Lange, S., Wiehagen, R. Polynomial-time inference of arbitrary pattern languages. NGCO 8, 361–370 (1991). https://doi.org/10.1007/BF03037093

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037093

Keywords

Search

Navigation