Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1994: STACS 94 pp 661–668Cite as

Nondeterminism in patterns

  • Conference paper
  • First Online:

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

Abstract

The paper investigates nondeterminism and degrees of nondeterminism in representing words according to a pattern given a priori. The issues involved belong to the basic combinatorics of words. Our main results concern decidability and construction of finite degrees of nondeterminism.

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

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. J. Bean, A. Ehrenfeucht, G. McNulty, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics 85(1979) 261–294.

    Google Scholar 

  3. J. Cassaigne, Unavoidable binary patterns, Acta Informatica 30 (1993) 385–395.

    Google Scholar 

  4. K. Culik II, J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht's conjecture, Discrete Mathematics 43 (1983) 139–153.

    Google Scholar 

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

    Google Scholar 

  6. T. Jiang, A. Salomaa, K. Salomaa, S. Yu, Inclusion is undecidable for pattern languages, ICALP-93 Proceedings, Springer Lecture Notes in Computer Science 700 (1993) 301–312.

    Google Scholar 

  7. V. Keränen, Abelian squares can be avoided on four letters, Springer Lecture Notes in Computer Science 623 (1992) 41–52.

    Google Scholar 

  8. G. Kucherov, M. Rusinowitch, On ground reducibility problem for word rewriting systems with variables, Centre de Recherche en Informatique de Nancy, Report CRIN 93-R-012.

    Google Scholar 

  9. G.S. Makanin, The problem of solvability of equations in a free semigroup (in Russian), Matematiceskij Sbornik 103 (145) (1977) 148–236.

    Google Scholar 

  10. A. Salomaa, Formal Languages, Academic Press, 1973.

    Google Scholar 

  11. A. Thue, über unendliche Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania 7(1906) 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academy of Finland and Department of Mathematics, University of Turku, SF-20500, Turku, Finland

    Alexandru Mateescu & Arto Salomaa

Authors
  1. Alexandru Mateescu
    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

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mateescu, A., Salomaa, A. (1994). Nondeterminism in patterns. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_179

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_179

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation