Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machines, Computations, and Universality

MCU 2001: Machines, Computations, and Universality pp 69–81Cite as

Combinatorial and Computational Problems on Finite Sets of Words

  • Conference paper
  • First Online:

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

Abstract

The goal of this paper is to give a survey on recent work studying several combinatorial and computational problems on finite sets of words. The problems are natural extensions of three well-understood problems on words, namely those of the commutation, the conjugacy, and the equivalence of morphisms on regular languages. Each of these problems provides challenging questions in the case of finite sets of words.

Supported under the grant #44087 of the Academy of Finland

Acknowledgement

The author is grateful to M. Hirvensalo and J. Manuch for the help in preparing

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, M. H. and Lawrence, J., A proof of Ehrenfeucht’s Conjecture, Theoret. Comput. Sci 41, pp. 121–123, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  2. Bergman, G. Centralizers in free associative algebras, Transactions of the American Mathematical Society 137, pp. 327–344, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cassaigne, J., Karhumäki, J., and Manuch, J., On conjugacy of languages, manuscript in preparation.

    Google Scholar 

  4. Crochemore, M. and Rytter, W., Text Algorithms, Oxford University Press, 1994.

    Google Scholar 

  5. Choffrut, C. and Karhumäki, J., Combinatorics on Words. In G. Rozenberg, A. Salomaa (eds.) Handbook of Formal Languages, vol 1, pp. 329–438, Springer-Verlag 1997.

    Google Scholar 

  6. Choffrut, C., Karhumäki, J., and Ollinger, N., The Commutation of finite sets: a challenging problem. Theoret. Comput. Sci., to appear.

    Google Scholar 

  7. Conway, J., Regular Algebra and Finite Machines, Chapman Hall, 1971.

    Google Scholar 

  8. Culik II, K. and Karhumäki, J., the equivalence of finite valued transducers (on HDT0L languages) is decidable, Theoret. Comput. Sci 47, pp.71–84, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  9. Diekert, V., Makanin’s Algorithm in M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, to appear.

    Google Scholar 

  10. Guba, V. S., The equivalence of infinite systems of equations in free groups and semigroups with finite systems (in Russian), Mat. Zametki 40, pp. 321–324, 1986.

    MATH  MathSciNet  Google Scholar 

  11. Makanin, S. G., The problem of solvability of equation in a free semigroup, Mat. Sb. 103, pp. 147–236, 1977 (English transl. in Math USSR Sb. 32, pp. 129-198).

    MathSciNet  Google Scholar 

  12. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitutions on regular language, Theoret. Inform. and Appl. 33, pp. 117–124, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  13. Harju, T., Ibarra, O., Karhumäki, J. and Salomaa, A., Decision questions concerning semilinearity, morphisms and commutation of languages, TUCS report 376, 2000.

    Google Scholar 

  14. Harju, T., Petre, I., personal communication.

    Google Scholar 

  15. Hopcroft, J. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA., 1979.

    MATH  Google Scholar 

  16. Karhumäki, J., Some open problems on combinatorics of words and related areas, Proceedings of Algebraic Systems, Formal Languages and Computations, RIMS Proceedings 1166, Research Institute for Mathematical Sciences, Kyoto University, pp. 118–130, 2000.

    Google Scholar 

  17. Karhumäki, J. and Lisovik, L.. On the equivalence of finite substitutions and transducers, In J. Karhumäki, H. Maurer, Gh. Păun and G. Rozenberg (eds.) Jewels are Forever, pp. 97–108, Springer 1999.

    Google Scholar 

  18. Karhumäki, J. and Lisovik, L., A simple undecidable problem: The inclusion problem for finite substitutions on ab*c, Proceedings of STACS01, Lecture Notes in Computer Science, to appear.

    Google Scholar 

  19. Karhumäki, J., Mignosi, F., and Plandowski, W., On expressibility of languages and relations by word equations, JACM 47, 2000.

    Google Scholar 

  20. Karhumäki, J. and Petre, I., On the centralizer of a finite set, Proceedings of ICALP 00, Lecture Notes in Computer Science 1853, 536–546, 2000.

    Google Scholar 

  21. Lawrence, J., The non-existence of finite test sets for set equivalence of finite substitutions, Bull. EATCS 28, pp. 34–37, 1986.

    MATH  Google Scholar 

  22. Lisovik, L. P., The equivalence problem for finite substitutions on regular languages, Doklady of Academy of Sciences of Russia 357, pp. 299–301, 1997.

    MathSciNet  Google Scholar 

  23. Lothaire, M., Combinatorics on Words, Adison-Wesley, Reading, MA., 1983.

    MATH  Google Scholar 

  24. Plandowski, W., Satisfiability of word equations with constants is in PSPACE, proceedings of FOCS’99, pp. 495–500, 1999.

    Google Scholar 

  25. Ratoandramanana, B., Codes et motifs, RAIRO Inform. Theor., 23:4, pp. 425–444, 1989.

    Google Scholar 

  26. Turakainen, P., On some transducer equivalence problems for families of languages, Intern. J. Computer Math. 23, 99–124, 1988.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014, Turku, Finland

    Juhani Karhumäki

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LITA, UFR MIM, Université de Metz, Ile du Saulcy, 57045, Metz, Cedex, France

    Maurice Margenstern

  2. Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova, 5 Academiei str, 2028, Chiŗinău, Moldova

    Yurii Rogozhin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J. (2001). Combinatorial and Computational Problems on Finite Sets of Words. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45132-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42121-4

  • Online ISBN: 978-3-540-45132-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation