Skip to main content
SpringerLink
Log in

Coding with traces

  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

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

Included in the following conference series:

Abstract

We prove that the existence of a coding between two trace monoids is decidable for some families of trace monoids. Decidability heavily depends on the structure of the dependence graphs. The concept of coding is based on the new notion of strong morphism between trace monoids.

This work was partially supported by ESPRIT-BRA Working Group 6317 ASMICS.

Partially supported by ESPRIT-BRA Working Group 6317 ASMICS and Project 40% MURST Algoritmi, Modelli di Calcolo e Strutture Informative.

Partially supported by a C.N.R. fellowship and Cooperation Project C.G.R.I.-C.N.R.S. Théorie des Automates et Applications.

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. I.J. Aalbersberg, H.J. Hoogeboom, Characterizations of the decidability of some problems for regular trace languages, Math. Systems Theory 22 (1989) 1–19.

    Google Scholar 

  2. I.J. Aalbersberg, G. Rozenberg, Theory of traces, Theoret. Comput. Sci. 60 (1988) 1–82.

    Google Scholar 

  3. A. Apostolico, R. Giancarlo, Pattern matching machine implementation of a fast test for unique decipherability, Information Processing Letters 18 (1984) 155–158.

    Google Scholar 

  4. J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985.

    Google Scholar 

  5. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.

    Google Scholar 

  6. V. Bruyère, C. De Felice, G. Guaiana, Decidability for coding between trace monoids, in preparation (1993).

    Google Scholar 

  7. R.M. Capocelli, Comments on “Trends in the Theory of Codes” by J. Berstel and D. Perrin, Bull. EATCS 30 (1986) 43–44.

    Google Scholar 

  8. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics 85, Springer, Berlin Heidelberg New-York (1969).

    Google Scholar 

  9. C. Choffrut, Free partially commutative monoids, Technical report 86–20, LITP, Université Paris 7 (1986).

    Google Scholar 

  10. M. Chrobak, W. Rytter, Unique decipherability for partially commutative alphabets, Fundamenta Informaticae 10 (1987) 323–336.

    Google Scholar 

  11. R. Cori, Y. Métivier, Recognizable subsets of some partially abelian monoids, Theoret. Comput. Sci. 35 (1985) 241–254.

    Google Scholar 

  12. R. Cori, D. Perrin, Automates et commutations partielles, RAIRO, Inform. Théor. 19 (1985) 21–32.

    Google Scholar 

  13. V. Diekert, Research topics in the theory of free partially commutative monoids, Bulletin of EATCS 40 (1990) 479–491.

    Google Scholar 

  14. V. Diekert, Combinatorics on traces, Lecture Notes in Comput. Sci. 454, Springer, Berlin Heidelberg New-York (1990).

    Google Scholar 

  15. V. Diekert, G. Rozenberg Tracebook, to appear (1993).

    Google Scholar 

  16. C. Duboc, Commutations dans les monoÏdes libres: un cadre théorique pour l'étude du parallélisme, thèse, Université de Rouen (1986).

    Google Scholar 

  17. C. Duboc, On some equations in free partially commutative monoids, Theoret. Comput. Sci. 46 (1986) 159–174.

    Google Scholar 

  18. E. Galvin, J. L. Peterson, A. Silberschatz, Operating System Concept, Addison Wesley Publishing Company, 1991.

    Google Scholar 

  19. L. Lovasz, Normal hypergraphs and the perfect graph conjecture, Discr. Math. 2 (1972) 253–267.

    Google Scholar 

  20. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus (1977).

    Google Scholar 

  21. A. Mazurkiewicz, Trace theory, in W. Brauer et al. Ed., Petri Nets, applications and relationship to other models of concurrency, Lecture Notes in Comput. Sci. 255 (1987) 279–324.

    Google Scholar 

  22. E. Ochmanski, On morphisms of trace monoids, Proc. STACS 88, Lecture Notes Comput. Sci. 294 (1988) 346–355.

    Google Scholar 

  23. D. Perrin, Partial commutations, Lecture Notes Comput. Sci. 372 (1989) 637–651.

    Google Scholar 

  24. F. P. Preparata, Introduction to Computer Engineering, Harper and Row, New York, 1985.

    Google Scholar 

  25. M. Rodeh, A fast test for unique decipherability based on suffix trees, IEEE Trans. Inform. Theory 28 (1982) 648–651.

    Google Scholar 

  26. A.A. Sardinas, C.W. Patterson, A necessary and sufficient condition for the unique decomposition of coded messages, IRE Internat. Conv. Rec. 8 (1953) 104–108.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Mons-Hainaut, 15 Avenue Maistriau, B-7000, Mons, Belgium

    Véronique Bruyère

  2. Dipartimento di Informatica ed Applicazioni, Università di Salerno, I-84081, Baronissi, SA, Italy

    Clelia De Felice

  3. Institut Blaise Pascal, L.I.T.P., Université Paris 7, 2 place Jussieu, F-75251, Paris cedex 05, France

    Giovanna Guaiana

  4. Dipartimento di Matematica e Applicazioni, Università di Palermo, via Archirafi 34, I-90123, Palermo, Italy

    Giovanna Guaiana

Authors
  1. Véronique Bruyère
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clelia De Felice
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giovanna Guaiana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruyère, V., De Felice, C., Guaiana, G. (1994). Coding with traces. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_154

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation