A note on polynomial-time inference of k-variable pattern languages
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.
Unable to display preview. Download preview PDF.
- [Angluin]D. Angluin, Finding Patterns Common to a Set of Strings, J. Comp. Syst. Sciences 21(1980), 46–62Google Scholar
- [Gold'67]E.M. Gold, Language Identification in the Limit, Information and Control 10(1967), 447–474Google Scholar
- [Gold'78]E.M. Gold, Complexity of Automaton Identification from Given Data, Information and Control 37(1978), 302–320Google Scholar
- [Lange/Wiehagen]S. Lange and R. Wiehagen, Polynomial-Time Inference of Arbitrary Pattern Languages, New Generation Computing 8(1991), 361–370Google Scholar
- [Nix]R.P. Nix, Editing by Example, Yale Univ., Techn. Report 280, 1983Google Scholar
- [Shinohara]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–127Google Scholar