Skip to main content
SpringerLink
Log in

Inclusion is undecidable for pattern languages

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 700))

Included in the following conference series:

Abstract

The inclusion problem for (nonerasing) pattern languages was raised by Angluin [1] in 1980. 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.

The work reported here has been supported by the Natural Sciences and Engineering Research Council of Canada grants OGP0041630 and OGP0046613, an NSERC International Fellowship, and the Project 11281 of the Academy of Finland.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin, “Finding patterns common to a set of strings”, Journal of Computer and System Sciences 21 (1980) 46–62.

    Google Scholar 

  2. D. Angluin, “Inductive inference of formal languages from positive data”, Information and Control 45 (1980) 117–135.

    Google Scholar 

  3. B.S. Baker and R.V. Book, “Reversal-bounded multipushdown machines”, Journal of Computer and System Sciences 8 (1974) 315–332.

    Google Scholar 

  4. D. R. Bean, A. Ehrenfeucht, and G. F. McNulty, “Avoidable patterns in strings of symbols”, Pacific Journal of Mathematics 85 (1979) 261–294.

    Google Scholar 

  5. T. Harju and J. Karhumäki, “The equivalence problem of multitape finite automata”, Theoretical Computer Science 78 (1991) 347–355.

    Google Scholar 

  6. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978.

    Google Scholar 

  7. O.H. Ibarra, “Reversal-bounded multicounter machines and their decision problems”, Journal of the Association for Computing Machinery 25 (1978) 116–133.

    Google Scholar 

  8. O. Ibarra and T. Jiang “Learning regular languages from counterexamples”, Journal of Computer and System Sciences, 43 (1991) 299–316.

    Google Scholar 

  9. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, S. Yu, “Pattern languages with and without erasing”, to appear in the International Journal of Computer Mathematics.

    Google Scholar 

  10. M.L. Minsky, “Recursive unsolvability of Post's problem of ‘Tag’ and other topics in theory of Turing machines”, Annals of Mathematics 74 (1961) 437–455.

    Google Scholar 

  11. N. Tanida and T. Yokomori, “Polynomial-time identification of strictly regular languages in the limit”, IEICE Trans. Inf. and Syst. E75-D (1992) 125–132.

    Google Scholar 

  12. A. Thue, “über unendliche Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl, Christiania 7 (1906) 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Tao Jiang

  2. Academy of Finland and Mathematics Dept., University of Turku, 20500, Turku, Finland

    Arto Salomaa

  3. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Kai Salomaa & Sheng Yu

Authors
  1. Tao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Lingas Rolf Karlsson Svante Carlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, T., Salomaa, A., Salomaa, K., Yu, S. (1993). Inclusion is undecidable for pattern languages. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-56939-1_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56939-8

  • Online ISBN: 978-3-540-47826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation