Skip to main content
SpringerLink
Log in

On morphisms of trace monoids

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

Abstract

Morphisms of trace monoids are studied in the paper. Their relations to morphisms of free monoids are described. Injective trace morphisms are investigated and decidability of injectivity is proved for morphisms of abelian trace monoids. An effective general characterization of trace morphisms preserving regularity (recognizability) is given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. IJ.J. Aalbersberg & G. Rozenberg — Theory of Traces — University of Leiden, Report 86-16 (1986)

    Google Scholar 

  2. J. Berstel — Transductions and Context-Free Languages — Teubner Studienbucher Informatik, Stuttgart (1979)

    Google Scholar 

  3. P. Cartier & D. Foata — Problèmes Combinatoires de Commutation et Réarrangements — Lecture Notes in Mathematics 85 (1969)

    Google Scholar 

  4. R. Cori — Partially Abelian Monoids — Université de Bordeaux I, R.G. 1.86 (1986)

    Google Scholar 

  5. R. Cori & Y. Métivier — Recognizable Subsets of Some Partially Abelian Monoids — Theoretical Computer Science 35 (1985)

    Google Scholar 

  6. R. Cori & D. Perrin — Automates et Commutations Partielles — RAIRO Informatique Théorique et Application 19 (1985)

    Google Scholar 

  7. C. Duboc — Some Properties of Commutation in F-P-C Monoids — Information Processing Letters 20 (1985)

    Google Scholar 

  8. C. Duboc — Equations in Free Partially Commutative Monoids — Lecture Notes in Computer Science 210 (1986)

    Google Scholar 

  9. G. Lallement — Semigroups and Combinatorial applications — Wiley & Sons, New York (1979)

    Google Scholar 

  10. A. Mazurkiewicz — Concurrent Program Schemes and Their Interpretations — Aarhus University, DAIMI-PB-78 (1977)

    Google Scholar 

  11. A. Mazurkiewicz — Trace Theory — Lecture Notes in Computer Science 255 (1987)

    Google Scholar 

  12. Y. Métivier — On Recognizable Subsets of Free Partially Abelian Monoids — Lecture Notes in Computer Science 226 (1986)

    Google Scholar 

  13. E. Ochmanski — Regular Behaviour of Concurrent Systems — Bulletin of EATCS 27 (1985)

    Google Scholar 

  14. D. Perrin — Words — Combinatorics on Words by M. Lothaire, Addison-Wesley (1983)

    Google Scholar 

  15. W. Zielonka — Notes on Finite Asynchronous Automata — RAIRO Informatique théorique et Applications 21 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, P.O. Box 22, PKiN, 00-901, Warszawa

    Edward Ochmanski

Authors
  1. Edward Ochmanski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ochmanski, E. (1988). On morphisms of trace monoids. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035858

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation