Name
Abstract | ||
|---|---|---|
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 to 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 et al. (Pattern languages with and without erasing, 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.tcs.2010.05.033 | Theoretical Computer Science |
Keywords | Field | DocType |
Pattern languages,Descriptive patterns | Inductive reasoning,Discrete mathematics,Combinatorics,Formal language,Algebra,Infinite set,Morphism,Mathematics | Journal |
Volume | Issue | ISSN |
411 | 34 | Theoretical Computer Science |
Citations | PageRank | References |
3 | 0.40 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dominik D. Freydenberger | 1 | 89 | 9.14 |
| Daniel Reidenbach | 2 | 154 | 18.06 |