Inclusion Problems for Patterns with a Bounded Number of Variables

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.

• Type: Conference
• Year: 2010
• Where: DLT
• Authors: Joachim Bremer, Dominik D. Freydenberger
• Keywords: Complicated Inclusion Relations, DLT 2010, Inclusion Problem, Open Inclusion Problem, Theoretical Computer Science