Some decision problems for traces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1234, Issue , 1997, Pages 248-257

  Matiyasevich, Yuri ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

DECISION PROBLEMS; FREE MONOIDS; NEW RESULTS; WORD EQUATIONS;

TRACE ELEMENTS;

EID: 0012712272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_25     Document Type: Conference Paper

References (11)

1. P. Cartier and D. Floata. Probleme combinatoires de commutation et rearrangements. Lecture Notes in Mathematics, 85, 1969.
2. M. Chrobak and W. Rytter. Unique decipherability for partially commutative alphabets. Fundamenta Informaticae, X:323-336, 1987.
3. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Sin-gapoure a.o., 1995.
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.
5. Hendrik Jan Hoogeboom and Anca Muscholl. The code problem for traces-improving the boundaries. Theoretical Computer Science, 172:309-321, 1997.
6. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbomik, 32(2):129-198, 1977.
7. Youri Matiiassevitch. Mots et codes: Cas décidables et indécidables du probleme du codage pour les monoïdes partialement commutatifs. Quadrature, 27:23-33, 1997.
8. Y. V. Matiyasevich. Desyataya Problema Gilberta. Nauka, Moscow, 1993. English translation: Hilbert’s tenth problem. MIT Press, 1993. French translation: Le dixtme probleme de Hilbert. Masson, 1995.
9. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarus University, Aaurus, 1977.
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.
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.