Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorics on Words

WORDS 2017: Combinatorics on Words pp 1–5Cite as

Commutation and Beyond

Extended Abstract

  • Conference paper
  • First Online:

  • 511 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10432))

Abstract

We survey some properties of simple relations between words.

Š. Holub—Supported by the Czech Science Foundation grant number 13-01832S.

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 EPUB and 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

References

  1. Appel, K.I., Djorup, F.M.: On the equation \(z^n_1z^n_2z^n_k=y_n\) in a free semigroup. Trans. Am. Math. Soc. 134(3), 461–470 (1968)

    MATH  Google Scholar 

  2. Barbin-Le Rest, E., Le Rest, M.: Sur la combinatoire des codes à deux mots. Theor. Comput. Sci. 41, 61–80 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Karel Culik, I.I., Karhumäki, J.: On the equality sets for homomorphisms on free monoids with two generators. RAIRO ITA 14(4), 349–369 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  4. Czeizler, E., Holub, Š., Karhumäki, J., Laine, M.: Intricacies of simple word equations: an example. Internat. J. Found. Comput. Sci. 18(6), 1167–1175 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Day, J.D., Reidenbach, D., Schneider, J.C.: On the dual post correspondence problem. Int. J. Found. Comput. Sci. 25(8), 1033–1048 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Day, J.D., Reidenbach, D., Schneider, J.C.: Periodicity forcing words. Theor. Comput. Sci. 601, 2–14 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: On binary equality sets and a solution to the test set conjecture in the binary case. J. Algebra 85(1), 76–85 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hadravová, J.: A length bound for binary equality words. Commentat. Math. Univ. Carol. 52(1), 1–20 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Hadravová, J.: Structure of equality sets. Ph.D. thesis, Charles University, Prague (2015)

    Google Scholar 

  10. Hadravová, J., Holub, Š.: Large simple binary equality words. Int. J. Found. Comput. Sci. 23(06), 1385–1403 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hadravová, J., Holub, Š.: Equation \(x^iy^jx^k=u^iv^ju^k\) in Words. In: Dediu, A.-H., Formenti, E., Martín-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 414–423. Springer, Cham (2015). doi:10.1007/978-3-319-15579-1_32

    Google Scholar 

  12. Hakala, I., Kortelainen, J.: On the system of word equations \(x^ i_1 x^i_2{\ldots }x^i_m=y^i_1 y^i_2{\ldots }y^i_n (i=1, 2, {\ldots })\) in a free monoid. Acta Informatica 34(3), 217–230 (1997)

    Article  MathSciNet  Google Scholar 

  13. Halava, V., Holub, Š.: Binary (generalized) post correspondence problem is in P. Technical report 785, Turku Centre for Computer Science (2006)

    Google Scholar 

  14. Harju, T., Nowotka, D.: The equation \(x^i = y^jz^k\) in a free semigroup. Semigroup Forum 68(3), 488–490 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Harju, T., Nowotka, D.: On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup. Theor. Comput. Sci. 330(1), 117–121 (2005)

    Article  MATH  Google Scholar 

  16. Holub, Š.: Local and global cyclicity in free semigroups. Theor. Comput. Sci. 262(1), 25–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Holub, Š.: A unique structure of two-generated binary equality sets. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 245–257. Springer, Heidelberg (2003). doi:10.1007/3-540-45005-X_21

    Chapter  Google Scholar 

  18. Holub, Š., Kortelainen, J.: Linear size test sets for certain commutative languages. Theor. Inform. Appl. 35(5), 453–475 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lentin, A., Schützenberger, M.-P.: A combinatorial problem in the theory of free monoids. In: Algebraic Theory of Semigroups. North-Holland Pub. Co., Amsterdam, New York (1979)

    Google Scholar 

  20. Lyndon, R.C., Schützenberger, M.-P.: The equation \(a^m=b^nc^p\) in a free group. Michigan Math. J. 9(4), 289–298 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  21. Saarela, A.: Word equations where a power equals a product of powers. In: STACS: Leibniz International Proceedings in Informatics, vol. 66, pp. 55:1–55:9. Dagstuhl, Germany (2017)

    Google Scholar 

  22. Spehner, J.-P.: Quelques problèmes d’extension, de conjugaison et de presentation des sous-monoïdes d’un monoïde libre. PhD thesis, Université Paris VII, Paris (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algebra, Charles University, Prague, Czech Republic

    Štěpán Holub

Authors
  1. Štěpán Holub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Štěpán Holub .

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal, Montreal, Québec, Canada

    Srečko Brlek

  2. Université du Québec à Montréal, Montreal, Québec, Canada

    Francesco Dolce

  3. Université du Québec à Montréal, Montreal, Québec, Canada

    Christophe Reutenauer

  4. Université du Québec à Montréal, Montreal, Québec, Canada

    Élise Vandomme

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Holub, Š. (2017). Commutation and Beyond. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, É. (eds) Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science(), vol 10432. Springer, Cham. https://doi.org/10.1007/978-3-319-66396-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66396-8_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66395-1

  • Online ISBN: 978-3-319-66396-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation