Existence and Nonexistence of Descriptive Patterns

  • Dominik D. Freydenberger
  • Daniel Reidenbach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5583)

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 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Brazma, A., Jonassen, I., Eidhammer, I., Gilbert, D.: Approaches to the automatic discovery of patterns in biosequences. Journal of Computational Biology 5, 279–305 (1998)CrossRefGoogle Scholar
  3. 3.
    Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Information Processing Letters 9, 86–88 (1979)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Freydenberger, D.D., Reidenbach, D.: Bad news on decision problems for patterns. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 5.
    Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. International Journal of Computer Mathematics 50, 147–163 (1994)CrossRefMATHGoogle Scholar
  6. 6.
    Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. Journal of Computer and System Sciences 50, 53–63 (1995)MathSciNetCrossRefMATHGoogle Scholar
  7. 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
  8. 8.
    Ng, Y.K., Shinohara, T.: Developments from enquiries into the learnability of the pattern languages from positive data. Theoretical Computer Science 397, 150–165 (2008)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Reidenbach, D., Schneider, J.C.: Morphically primitive words. Theoretical Computer Science 410, 2148–2161 (2009)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)CrossRefMATHGoogle Scholar
  11. 11.
    Salomaa, K.: Patterns. In: Martin-Vide, C., Mitrana, V., Păun, G. (eds.) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol. 148, pp. 367–379. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  13. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dominik D. Freydenberger
    • 1
  • Daniel Reidenbach
    • 2
  1. 1.Institut für InformatikGoethe-UniversitätFrankfurt am MainGermany
  2. 2.Department of Computer ScienceLoughborough UniversityLoughboroughUnited Kingdom

Personalised recommendations