Decision Problems for Patterns

We settle an open problem, the inclusion problem for pattern languages. This is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalence problem. The study of patterns goes back to the seminal work of Thue and is important also, for instance, in recent work concerning inductive inference and learning. Our results concern both erasing and nonerasing patterns.

[1]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[2]  Dana Angluin,et al.  Finding patterns common to a set of strings (Extended Abstract) , 1979, STOC.

[3]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[4]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[5]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[6]  Arto Salomaa,et al.  Pattern languages with and without erasing , 1994 .

[7]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[8]  Noriyuki Tanida,et al.  Polynomial-Time Identification of Strictly Regular Languages in the Limit , 1992 .

[9]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[10]  Tao Jiang,et al.  Learning regular languages from counterexamples , 1988, COLT '88.

[11]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[12]  Veikko Keränen,et al.  Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.

[13]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[14]  Tero Harju,et al.  The Equivalence Problem of Multitape Finite Automata , 1991, Theor. Comput. Sci..

[15]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.