Abstract
A pattern is a finite string of constants and variables. The language of a pattern is the set of strings which can be óbtained by substituting non-null strings for the variables in the pattern. We consider the problem of learning pattern languages from positive example. We show that, for every k, the whole family of k-variable pattern languages can be identified in the limit by a consistent polynomial-time strategy.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Finding Patterns Common to a Set of Strings, J. Comp. Syst. Sciences 21(1980), 46–62
E.M. Gold, Language Identification in the Limit, Information and Control 10(1967), 447–474
E.M. Gold, Complexity of Automaton Identification from Given Data, Information and Control 37(1978), 302–320
S. Lange and R. Wiehagen, Polynomial-Time Inference of Arbitrary Pattern Languages, New Generation Computing 8(1991), 361–370
R.P. Nix, Editing by Example, Yale Univ., Techn. Report 280, 1983
T. Shinohara, Polynomial-Time Inference of Extended Regular Pattern Languges, in: Proc. of RIMS Symp. on Software Sci. an Engin., LNCS 147, Springer-Verlag, 1982, 115–127
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, S. (1991). A note on polynomial-time inference of k-variable pattern languages. In: Dix, J., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1990. Lecture Notes in Computer Science, vol 543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023323
Download citation
DOI: https://doi.org/10.1007/BFb0023323
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54564-4
Online ISBN: 978-3-540-38469-4
eBook Packages: Springer Book Archive