Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1998: Mathematical Foundations of Computer Science 1998 pp 503–511Cite as

Shuffle on trajectories: The schützenberger product and related operations

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

We investigate the problem of finding monoids that recognize languages of the form L 1 L 2, where T is an arbitrary set of trajectories. Thereby, we describe two such methods: one based on the so-called trajectories monoids and the other based on monoids of matrices. Many well-known operations such as catenation, bi-catenation, shuffle, literal shuffle and insertion are just particular instances of the operation . Hence, our results offer a uniform treatment for classical methods, notably the Schützenberger product. We also investigate some other related operations.

This work has been partially supported by the Project 137358 of the Academy of Finland.

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. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, vol. A, 1974, vol. B, 1976.

    MATH  Google Scholar 

  2. W. Kuich and A. Salomaa, Semirings, Automata, Languages, Springer-Verlag, Berlin, 1986.

    MATH  Google Scholar 

  3. A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Theoretical Computer Science, 197, 1–2, (1998) 1–56.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.E. Pin, Varieties of Formal Languages, North Oxford Academic, 1986.

    Google Scholar 

  5. J.E. Pin, “Syntactic Semigroups”, in Handbook of Formal Languages, eds. G. Rozenberg and A. Salomaa, Vol. 1, Springer, 1997, 679–746.

    Google Scholar 

  6. M.P. Schützenberger, “On finite monoids having only trivial subgroups”, Information and Control, 8, (1965) 190–194.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tero Harju & Arto Salomaa

  2. Turku Centre for Computer Science and Faculty of Mathematics, University of Bucharest, Romania

    Alexandra Mateescu

Authors
  1. Tero Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandra Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harju, T., Mateescu, A., Salomaa, A. (1998). Shuffle on trajectories: The schützenberger product and related operations. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055800

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation