# Polynomial time inference of general pattern languages

## Abstract

Assume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable symbols. A pattern p is a non-empty string of constant and variable symbols. The language L(p) is the set of all words over the alphabet of constant symbols generated from p by substituting some non-empty words for the variables in p. A sample S is a finite set of words over the same alphabet. A pattern p is descriptive of a sample S if and only if it is possible to generate all elements of S from p and, moreover, there is no other pattern q also able to generate S such that L(q) is a proper subset of L(p). The problem of finding a pattern being descriptive of a given sample is studied. It is known that the problem of finding a pattern of maximal length is NP-hard. Till now has be known a polynomial-time algorithm only for the special case of patterns containing only one variable symbol. The main result is a polynomial time algorithm constructing descriptive patterns of maximal length for the general case of patterns containing variable symbols from any finite set a priori fixed.

## Keywords

Inductive Inference Constant Symbol Input Word Pattern Language Variable Symbol## Preview

Unable to display preview. Download preview PDF.

## References

- /1/.ANGLUIN, Dana Finding patterns common to a set of strings, 11th Annual ACM Symposium on theory of Computing, Atlanta, Georgia, 1979, 130–141Google Scholar
- /2/.ANGLUIN, Dana Finding patterns common to a set of strings, Journal of Computer and Systems Science 21 (1980) 1, 46–62Google Scholar
- /3/.ANGLUIN, D. / SMITH, C. A survey of inductive inference: theory and methods, Yale Univ., Dep. Comp. Sci., Techn. Rep. 250, 1982Google Scholar
- /4/.KLETTE, R. / WIEHAGEN, R. Research in the theory of inductive inference by GDR mathematicians — a survey, Inf. Sciences 22 (1980), 149–169Google Scholar
- /5/.NIX, Robert P. Editing by Example, Yale Univ., Dep. Comp. Sci., Techn. Rep. 280, 1983Google Scholar
- /6/.SHINOHARA, Takeshi Polynomial time inference of extended regular pattern languages, RIMS Symposia on Software Science and Engineer., Kyoto, 1982, Lecture Notes in Comp. Sci. 147, 115–127Google Scholar
- /7/.SHINOHARA, Takeshi Polynomial time inference of pattern languages and its application, Proc. 7th IBM Symp. on MFCS, 1982Google Scholar
- /8/.SMITH, Douglas R. A survey of the synthesis of LISP programs from examples, BIERMANN/GUIHO/KODRATOFF (eds.), Automatic program construction techniques, MacMillan, 1983Google Scholar