Advertisement

On morphisms of trace monoids

  • Edward Ochmanski
Contributed Papers Trace Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    IJ.J. Aalbersberg & G. Rozenberg — Theory of Traces — University of Leiden, Report 86-16 (1986)Google Scholar
  2. [2]
    J. Berstel — Transductions and Context-Free Languages — Teubner Studienbucher Informatik, Stuttgart (1979)Google Scholar
  3. [3]
    P. Cartier & D. Foata — Problèmes Combinatoires de Commutation et Réarrangements — Lecture Notes in Mathematics 85 (1969)Google Scholar
  4. [4]
    R. Cori — Partially Abelian Monoids — Université de Bordeaux I, R.G. 1.86 (1986)Google Scholar
  5. [5]
    R. Cori & Y. Métivier — Recognizable Subsets of Some Partially Abelian Monoids — Theoretical Computer Science 35 (1985)Google Scholar
  6. [6]
    R. Cori & D. Perrin — Automates et Commutations Partielles — RAIRO Informatique Théorique et Application 19 (1985)Google Scholar
  7. [7]
    C. Duboc — Some Properties of Commutation in F-P-C Monoids — Information Processing Letters 20 (1985)Google Scholar
  8. [8]
    C. Duboc — Equations in Free Partially Commutative Monoids — Lecture Notes in Computer Science 210 (1986)Google Scholar
  9. [9]
    G. Lallement — Semigroups and Combinatorial applications — Wiley & Sons, New York (1979)Google Scholar
  10. [10]
    A. Mazurkiewicz — Concurrent Program Schemes and Their Interpretations — Aarhus University, DAIMI-PB-78 (1977)Google Scholar
  11. [11]
    A. Mazurkiewicz — Trace Theory — Lecture Notes in Computer Science 255 (1987)Google Scholar
  12. [12]
    Y. Métivier — On Recognizable Subsets of Free Partially Abelian Monoids — Lecture Notes in Computer Science 226 (1986)Google Scholar
  13. [13]
    E. Ochmanski — Regular Behaviour of Concurrent Systems — Bulletin of EATCS 27 (1985)Google Scholar
  14. [14]
    D. Perrin — Words — Combinatorics on Words by M. Lothaire, Addison-Wesley (1983)Google Scholar
  15. [15]
    W. Zielonka — Notes on Finite Asynchronous Automata — RAIRO Informatique théorique et Applications 21 (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Edward Ochmanski
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarszawa

Personalised recommendations