Skip to main content
SpringerLink
Log in

Binary Intersection Revisited

  • Conference paper
  • First Online:
Combinatorics on Words (WORDS 2019)

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

Included in the following conference series:

  • 288 Accesses

Abstract

We reformulate the classical result by Juhani Karhumäki characterizing intersections of two languages of the form \(\{x,y\}^*\cap \{u,v\}^*\). We use the terminology of morphisms which allows to formulate the result in a shorter and more transparent way.

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

Access this chapter

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

Institutional subscriptions

References

  1. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 329–438. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5_6

    Chapter  Google Scholar 

  2. Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theoret. Comput. Sci. 21(2), 119–144 (1982). https://doi.org/10.1016/0304-3975(89)90080-7

    Article  MathSciNet  MATH  Google Scholar 

  3. Halava, V., Harju, T., Hirvensalo, M.: Binary (generalized) Post correspondence problem. Theoret. Comput. Sci. 276(1–2), 183–204 (2002). https://doi.org/10.1016/S0304-3975(01)00157-8

    Article  MathSciNet  MATH  Google Scholar 

  4. Halava, V., Holub, Š.: Reduction tree of the binary generalized Post correspondence problem. Int. J. Found. Comput. Sci. 22(2), 473–490 (2011). https://doi.org/10.1142/S0129054111008143

    Article  MathSciNet  MATH  Google Scholar 

  5. Holub, Š.: Binary equality sets are generated by two words. J. Algebra 259(1), 1–42 (2003). https://doi.org/10.1016/S0021-8693(02)00534-3

    Article  MathSciNet  MATH  Google Scholar 

  6. Karhumäki, J.: A note on intersections of free submonoids of a free monoid. Semigroup Forum 29(1), 183–205 (1984). https://doi.org/10.1007/BF02573324

    Article  MathSciNet  MATH  Google Scholar 

  7. Lothaire, M.: Combinatorics on words. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1997). https://doi.org/10.1017/CBO9780511566097

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algebra, Charles University, Sokolovská 83, 175 86, Praha, 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. Loughborough University, Loughborough, UK

    Robert Mercaş

  2. Loughborough University, Loughborough, UK

    Daniel Reidenbach

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Holub, Š. (2019). Binary Intersection Revisited. In: Mercaş, R., Reidenbach, D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science(), vol 11682. Springer, Cham. https://doi.org/10.1007/978-3-030-28796-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-28796-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-28795-5

  • Online ISBN: 978-3-030-28796-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation