Inclusion problems for patterns with a bounded number of variables

Authors:
Joachim Bremer;Dominik D. Freydenberger
Affiliations:
Institut für Informatik, Goethe Universität, Frankfurt am Main, Germany;Institut für Informatik, Goethe Universität, Frankfurt am Main, Germany
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 9
Cited 4

Decision problems for patterns

Journal of Computer and System Sciences
A note on parsing pattern languages

Pattern Recognition Letters
Combinatorics of words

Handbook of formal languages, vol. 1
On the equivalence problem for E-pattern languages

Theoretical Computer Science
Frontier between decidability and undecidability: a survey

Theoretical Computer Science - Special issue on universal machines and computations
Finding patterns common to a set of strings (Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Developments from enquiries into the learnability of the pattern languages from positive data

Theoretical Computer Science
Four Small Universal Turing Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Bad news on decision problems for patterns

Information and Computation

Patterns with bounded treewidth

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Inclusion problems for patterns with a bounded number of variables

Information and Computation
A note on the complexity of matching patterns with variables

Information Processing Letters
Regular and context-free pattern languages over small alphabets

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.