Abstract
The inclusion problem for (nonerasing) pattern languages was raised by Angluin [1] in ]980. It has been open ever since. In this paper, we settle this open problem and show that inclusion is undecidable for (both erasing and nonerasing) pattern languages. In addition, we show that a special case of the inclusion problem, i.e., the inclusion problem for terminal-free erasing pattern languages, is decidable.
Author supplied keywords
Cite
CITATION STYLE
Jiang, T., Salomaa, A., Salomaa, K., & Yu, S. (1993). Inclusion is undecidable for pattern languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 301–312). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
