Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1996: Mathematical Foundations of Computer Science 1996 pp 2–17Cite as

Code problems on traces

  • Invited Papers
  • Conference paper
  • First Online:

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

Abstract

The topic of codes in the framework of trace monoids leads to interesting and challenging decision problems of combinatorial flavour. We give an overview of the current state of some basic questions in this field. Among these, we consider the existence problem for strong codings, clique-preserving morphisms and the unique decipherability problem (code problem).

This research has been supported in part by the French-German research programme PROCOPE.

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

    Google Scholar 

  2. J. Berstel and D. Perrin. Theory of Codes. Pure and Applied Mathematics; 117. Academic Press, Orlando, Florida, 1985.

    Google Scholar 

  3. A. Bertoni, G. Mauri, and N. Sabadini. Equivalence and membership problems for regular trace languages. In Proceedings of the 9th International Colloquium on Automata, Languages and Programming (ICALP'82), number 140 in Lecture Notes in Computer Science, pages 61–71, Berlin-Heidelberg-New York, 1982. Springer.

    Google Scholar 

  4. V. Bruyère and C. De Felice. Trace codings. In E. Mayr and C. Puech, editors, Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), 1995, number 900 in Lecture Notes in Computer Science, pages 373–384, Berlin-Heidelberg-New York, 1995. Springer.

    Google Scholar 

  5. V. Bruyère and C. De Felice. Any lifting of a trace coding is a word coding. Submitted for publication, 1996.

    Google Scholar 

  6. V. Bruyère, C. De Felice, and G. Guaiana. Coding with traces. In P. Enjalbert, E. Mayr, and K. W. Wagner, editors, Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), 1994, number 775 in Lecture Notes in Computer Science, pages 353–364, Berlin-Heidelberg-New York, 1994. Springer.

    Google Scholar 

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

    Google Scholar 

  8. M. Chrobak and W. Rytter. Unique decipherability for partially commutative alphabets. Fundamenta Informaticae, X:323–336, 1987.

    Google Scholar 

  9. M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 34:241–254, 1984.

    Article  Google Scholar 

  10. R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O. — Informatique Théorique et Applications, 19:21–32, 1985.

    Google Scholar 

  11. M. D. Davis and E. J. Weyuker. Computability, complexity and languages. Academic Press, New York, 1983.

    Google Scholar 

  12. V. Diekert, A. Muscholl, and K. Reinhardt. On codings of traces. In E. Mayr and C. Puech, editors, Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), 1995, number 900 in Lecture Notes in Computer Science, pages 385–396, Berlin-Heidelberg-New York, 1995. Springer.

    Google Scholar 

  13. H. J. Hoogeboom and A. Muscholl. The code problem for traces — improving the boundaries. Submitted for publication.

    Google Scholar 

  14. G. Hotz and V. Claus. Automatentheorie und Formale Sprachen, Band III. Bibliographisches Institut, Mannheim, 1972.

    Google Scholar 

  15. G. S. Makanin. The problem of solvability of equations in free semigroups. Math. USSR Izvestiya, 21:483–546, 1983.

    Google Scholar 

  16. Yu. Matyiasevich. Cas décidables et indécidables du problème du codage pour les monoïdes partialement commutatifs. To appear in Quadrature.

    Google Scholar 

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

    Google Scholar 

  18. E. Ochmański. On morphisms of trace monoids. In R. Cori and M. Wirsing, editors, Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS'88), number 294 in Lecture Notes in Computer Science, pages 346–355, Berlin-Heidelberg-New York, 1988. Springer.

    Google Scholar 

  19. W. Rytter. The space complexity of the unique decipherability problem. Information Processing Letters, 23:1–3, 1986.

    Google Scholar 

  20. J. Sakarovitch. The “last” decision problem for rational trace languages. In I. Simon, editor, Proceedings of the 1st Latin American Symposium on Theoretical Informatics (LATIN'92), number 583 in Lecture Notes in Computer Science, pages 460–473, Berlin-Heidelberg-New York, 1992. Springer.

    Google Scholar 

  21. K. Wagner and G. Wechsung. Computational complexity. VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.

    Google Scholar 

  22. E. S. Wolk. A note on the comparability graph of a tree. Proc. of the Amer. Math. Soc., (16):17–20, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, D-70565, Stuttgart

    Volker Diekert & Anca Muscholl

Authors
  1. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anca Muscholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diekert, V., Muscholl, A. (1996). Code problems on traces. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_137

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_137

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70597-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation