Skip to main content

A note on intersections of free submonoids of a free monoid

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1983)

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

Included in the following conference series:

  • 121 Accesses

Abstract

According to a theorem of Tilson [7] any intersection of free submonoids of a free monoid is free. Here we consider intersections of the form {x,y}* ∩ {u,v}*, where x,y,u and v are words in a finitely generated free monoid ⌆*, and show that if both the monoids {x,y}* and {u,v* are of the rank two, then the intersection is a free monoid generated either by (at most) two words or by a regular language of the form Β0+Β(γ(1+δ+...+δt))*ɛ for some words Β0, Β, γ, δ and ɛ, and some integer t⩾0. An example is given showing that the latter possibility may occur for each t⩾0 with nonempty values of the words. If {x,y} and {u,v} are prefixes then necessarily t=0 and Β0=1.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D., Perrot, J.F. and Restivo A., Sur le théorème du défaut, J. Algebra 60 (1979) 169–180.

    Google Scholar 

  2. Blattner, M. and Head, T., Automata that recognize intersections of free submonoids, Information and Control 35 (1977) 173–176.

    Google Scholar 

  3. Ehrenfeucht, A., Karhumäki, J. and Rozenberg, G., On binary equality sets and a solution to the test set conjecture in the binary case, J. Algebra (to appear).

    Google Scholar 

  4. Harrison, M., Introduction to Formal Language Theory, Addison Wesley, Reading, Mass. (1973).

    Google Scholar 

  5. Karhumäki, J., A note on intersections of free submonoids of a free monoid, Research Report 82-64, LITP, University of Paris VII.

    Google Scholar 

  6. Lothaire, M., Combinatorics on Words, Addison Wesley, Reading, Mass. (1983).

    Google Scholar 

  7. Tilson, B., The intersection of free submonoids of a free monoid is free, Semigroup Forum 4 (1972) 345–350.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J. (1983). A note on intersections of free submonoids of a free monoid. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036924

Download citation

  • DOI: https://doi.org/10.1007/BFb0036924

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics