Existence and Nonexistence of Descriptive Patterns
In the present paper, we study the existence of descriptive patterns, i. e. patterns that cover all words in a given set through morphisms and that are optimal in terms of revealing commonalities of these words. Our main result shows that if patterns may be mapped onto words by arbitrary morphisms, then there exist infinite sets of words that do not have a descriptive pattern. This answers a question posed by Jiang, Kinber, Salomaa, Salomaa and Yu (International Journal of Computer Mathematics 50, 1994). Since the problem of whether a pattern is descriptive depends on the inclusion relation of so-called pattern languages, our technical considerations lead to a number of deep insights into the inclusion problem for and the topology of the class of terminal-free E-pattern languages.
KeywordsFormal Language Inductive Inference Technical Consideration Inclusion Problem Inclusion Relation
Unable to display preview. Download preview PDF.
- 7.Mateescu, A., Salomaa, A.: Patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, 4.6, vol. 1, pp. 230–242. Springer, Heidelberg (1997)Google Scholar
- 13.Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proc. 2nd Annual Workshop on Computational Learning Theory, COLT 1989, pp. 328–333 (1989)Google Scholar