Skip to main content
SpringerLink
Log in

Some decision problems for traces

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

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

Included in the following conference series:

Abstract

The notion of a word, considered as an element of a free monoid, has been long ago generalized to the notion of a trace, an element of a partially commutative monoÏd. Traces turned out to be useful tool for studying concurrency.

Every decision problem for words can be generalized to corresponding problem for traces. The main content of the paper is a proof of the decidability of trace equations, which is an extension of celebrated theorem of G. S. Makanin about decidability of word equations.

Several new results about decidable and undecidable cases of the code problem for traces are stated without proofs.

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. P. Cartier and D. Floata. Problème combinatoires de commutation et réarrangements. Lecture Notes in Mathematics, 85, 1969.

    Google Scholar 

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

    Google Scholar 

  3. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapoure a.o., 1995.

    Google Scholar 

  4. Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. Report 1997/01, Universität Stuttgart, Fakultät Informatik, 1997.

    Google Scholar 

  5. Hendrik Jan Hoogeboom and Anca Muscholl. The code problem for traces-improving the boundaries. Theoretical Computer Science, 172:309–321, 1997.

    Google Scholar 

  6. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.

    Google Scholar 

  7. Youri Matiiassevitch. Mots et codes: Cas décidables et indécidables du problème du codage pour les monoÏdes partialement commutatifs. Quadrature, 27:23–33, 1997.

    Google Scholar 

  8. Yu. V. Matiyasevich. Desyataya Problema Gilberta. Nauka, Moscow, 1993. English translation: Hilbert's tenth problem. MIT Press, 1993. French translation: Le dixime problème de Hilbert. Masson, 1995.

    Google Scholar 

  9. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarus University, Aaurus, 1977.

    Google Scholar 

  10. A. Sardinas and C. Patterson. A necessary and sufficient condition for the unique decomposition of coded messages. IRE Intern. Conv. Record, 8:104–108, 1953.

    Google Scholar 

  11. Klaus U. Schulz. Makanin's algorithm for word equations-Two improvements and a generalization. In K. U. Schulz, editor, Word equations and related topics. 1st International Workshop, IWWERT'90, Tübingen, Germany, October 1990, volume 572 of Lecture Notes in Computer Science, pages 85–150. Springer, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 27 Fontanka, 191011, St.Petersburg, Russia

    Yuri Matiyasevich

Authors
  1. Yuri Matiyasevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matiyasevich, Y. (1997). Some decision problems for traces. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation