Skip to main content
Springer Nature Link
Log in

A remark on trace equations

  • Chapter
  • First Online:
Foundations of Computer Science

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

  • 272 Accesses

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. Christian Choffrut. Combinatorics in trace monoids I. In V. Diekert and G. Rozenberg, editors, The Book of Traces, chapter 3, pages 71–82. World Scientific, Singapore, 1995.

    Google Scholar 

  2. Christian Choffrut and Juhani Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 329–438. Springer, Berlin-Heidelberg-New York, 1997.

    Google Scholar 

  3. Aldo de Luca and Antonio Restivo. On a generalization of a conjecture of Ehrenfeucht. Bulletin of the European Association for Theoretical Computer Science (EATCS), 30:84–90, 1986.

    Google Scholar 

  4. Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. In R. Gorrieri P. Degano and A. Marchetti-Spaccamela, editors, Proceedings of the24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna (Italy) 1997, number 1256 in Lecture Notes in Computer Science, pages 336–347, Berlin-Heidelberg-New York, 1997. Springer.

    Google Scholar 

  5. Volker Diekert and Grzegorz Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.

    Google Scholar 

  6. Christine Duboc. Some properties of commutation in free partially commutative monoids. Information Processing Letters, 20:1–4, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  7. Tero Harju and Juhani Karhumäki. On the defect theorem and simplifiability. Semigroup Forum, 33:199–217, 1986.

    MathSciNet  Google Scholar 

  8. Gennadií Semyonovich Makanin. The problem of solvability of equations in a free semigroup. Math. Sbornik, 103:147–236, 1977. English transl. in Math. USSR Sbornik 32 (1977).

    MATH  MathSciNet  Google Scholar 

  9. Yuri Matiyasevich. Reduction of trace equations to word equations. Talk given at the “Colloquium on Computability, Complexity, and Logic”, Institut für Informatik, Universität Stuttgart, Germany, Dec. 5–6, 1996.

    Google Scholar 

  10. Yuri Matiyasevich. Some decision problems for traces. In Sergej Adian and Anil Nerode, editors, Proceedings of the 4th International Symposium on Logical Foundations of Computer Science (LFCS'97), Yaroslavl, Russia, July 6–12, 1997, number 1234 in Lecture Notes in Computer Science, pages 248–257, Berlin-Heidelberg-New York, 1997. Springer. Invited lecture.

    Google Scholar 

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

    Google Scholar 

  12. Jean Pierre Pécuchet. Solutions principales et rang d'un système d'équations avec constantes dans le monoÏde libre. Discrete Mathematics, 48:253–274, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  13. Dominique Perrin. On the solution of Ehrenfeucht's Conjecture. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:68–70, 1985.

    Google Scholar 

  14. Klaus U. Schulz. Makanin's algorithm for word equations — Two improvements and a generalization. In Klaus U. Schulz, editor, Word Equations and Related Topics, number 572 in Lecture Notes in Computer Science, pages 85–150, Berlin-Heidelberg-New York, 1991. Springer.

    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

Authors
  1. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Additional information

This paper is dedicated to Prof. Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Diekert, V. (1997). A remark on trace equations. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052093

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

  • Online ISBN: 978-3-540-69640-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics