Decision Problems for Patterns
β
T. Jiang; A. Salomaa; K. Salomaa; S. Yu
π
Article
π
1995
π
Elsevier Science
π
English
β 742 KB
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