Inclusion Problems for Patterns with a Bounded Number of Variables

  • Joachim Bremer
  • Dominik D. Freydenberger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6224)

Abstract

We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (Information and Computation 208 (2010)) by showing that restricting the inclusion problem to significantly more restricted classes of patterns preserves undecidability, at least for comparatively large bounds. For smaller bounds, we prove the existence of classes of patterns with complicated inclusion relations, and an open inclusion problem, that are related to the Collatz Conjecture. In addition to this, we give the first proof of the undecidability of the inclusion problem for NE-pattern languages that, in contrast to previous proofs, does not rely on the inclusion problem for E-pattern languages, and proves the undecidability of the inclusion problem for NE-pattern languages over binary and ternary alphabets.

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. In: Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 130–141 (1979)Google Scholar
  2. 2.
    Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14, 1007–1018 (2003)MATHCrossRefGoogle Scholar
  3. 3.
    Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 6, vol. 1, pp. 329–438. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Durnev, V.G.: Undecidability of the positive ∀ ∃ 3-theory of a free semigroup. Siberian Math. J. 36(5), 917–929 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Inform. Process. Lett. 9, 86–88 (1979)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Freydenberger, D.D., Reidenbach, D.: Bad news on decision problems for patterns. Inform. and Comput. 208(1), 83–96 (2010)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ibarra, O.H., Pong, T.C., Sohn, S.M.: A note on parsing pattern languages. Pattern Recognit. Lett. 16(2), 179–182 (1995)CrossRefGoogle Scholar
  8. 8.
    Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Int. J. Comput. Math. 50, 147–163 (1994)MATHCrossRefGoogle Scholar
  9. 9.
    Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci. 50, 53–63 (1995)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Lagarias, J.C.: The 3x+1 problem: An annotated bibliography (1963-1999) (August 2009), http://arxiv.org/abs/math/0309224
  11. 11.
    Lagarias, J.C.: The 3x+1 problem: An annotated bibliography, II (2000-2009) (August 2009), http://arxiv.org/abs/math/0608208
  12. 12.
    Margenstern, M.: Frontier between decidability and undecidability: a survey. Theor. Comput. Sci. 231(2), 217–251 (2000)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Mitrana, V.: Patterns and languages: An overview. Grammars 2(2), 149–173 (1999)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Neary, T., Woods, D.: Four small universal Turing machines. Fundam. Inform. 91(1), 123–144 (2009)MATHMathSciNetGoogle Scholar
  15. 15.
    Ng, Y.K., Shinohara, T.: Developments from enquiries into the learnability of the pattern languages from positive data. Theor. Comput. Sci. 397, 150–165 (2008)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Ohlebusch, E., Ukkonen, E.: On the equivalence problem for E-pattern languages. Theor. Comput. Sci. 186, 231–248 (1997)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Reidenbach, D.: The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages. PhD thesis, Fachbereich Informatik, Technische Universität Kaiserslautern, Logos Verlag, Berlin (2006)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    Shinohara, T.: Polynomial time inference of pattern languages and its application. In: Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, pp. 191–209 (1982)Google Scholar
  20. 20.
    Thue, A.: Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl 7 (1906)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Joachim Bremer
    • 1
  • Dominik D. Freydenberger
    • 1
  1. 1.Institut für InformatikGoethe UniversitätFrankfurt am MainGermany

Personalised recommendations