Solving word equations modulo partial commutations

Theoretical Computer Science

Volumn 224, Issue 1-2, 1999, Pages 215-235

  Diekert, Volker ^a   Matiyasevich, Yuri ^b   Muscholl, Anca ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Partial commutations; Traces; Word equations; Word equations with regular constraints

Indexed keywords

EID: 0347032708     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00313-2     Document Type: Article

References (26)

1. IJ.J. Aalbersberg, H.J. Hoogeboom, Characterizations of the decidability of some problems for regular trace languages, Math. Systems Theory 22 (1989) 1-19.
2. C. Àlvarez, J. Gabarró, The parallel complexity of two problems on concurrency, Inform. Process. Lett. 38 (1991) 61-70.
3. A.V. Anisimov, D.E. Knuth, Inhomogeneous sorting, Internat. J. Comput. Inform. Sci. 8 (1979) 255-260.
4. J.R. Büchi, S. Senger, Definability in the existential theory of concatenation and undecidable extensions of this theory, Z. Math. Logik Grundlagen d. Math. 34 (1988) 337-342.
5. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, vol. 85, Springer, Berlin, 1969.
6. C. Choffrut, Combinatorics in trace monoids I, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, Ch. 3, World Scientific, Singapore, 1995, pp. 71-82.
7. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 1, Springer, Berlin, 1997, pp. 329-438.
8. V. Diekert, Yu. Matiyasevich, A. Muscholl, Solving trace equations using lexicographical normal forms, in: P. Degano et al. (Eds.), Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP'97), Bologna (Italy) 1997, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 336-347.
9. V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.
10. C. Duboc, On some equations in free partially commutative monoids, Theoret. Comput. Sci. 46 (1986) 159-174.
11. V.G. Durnev, On equations in free semigroups and groups, Mat. Zametki 16 (5) (1974) 717-724. (In Russian) English translation in: Math. Notes Acad. Sci. USSR 16 (1975) 1024-1028.
12. V.G. Durnev, On equations in free semigroups and groups, Mat. Zametki 16 (5) (1974) 717-724. (In Russian) English translation in: Math. Notes Acad. Sci. USSR 16 (1975) 1024-1028.
13. W. Ebinger, A. Muscholl, Logical definability on infinite traces, Theoret. Comput. Sci. 154 (1996) 67-84.
14. J. Karhumäki, W. Plandowski, F. Mignosi, The expressibility of languages and relations by word equations, in: P. Degano et al. (Eds.), Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP'97), Bologna (Italy), 1997, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 98-109.
15. R.M. Keller, Parallel program schemata and maximal parallelism I. Fundamental results, J. Assoc. Comput. Mach. 20 (3) (1973) 514-537.
16. G. S. Makanin, The problem of solvability of equations in a free semigroup, Math. Sbornik 103 (1977) 147-236, (English transl. in Math. USSR Sbornik 32 (1977)).
17. G. S. Makanin, The problem of solvability of equations in a free semigroup, Math. Sbornik 103 (1977) 147-236, (English transl. in Math. USSR Sbornik 32 (1977)).
18. Yu. V. Matiyasevich, Enumerable sets are Diophantine, Dok. Akad. Nauk SSSR 191 (2) (1970) 279-282. (English transl. in Soviet Mathematics. Doklady, 11 (2) (1970)).
19. Yu. V. Matiyasevich, Enumerable sets are Diophantine, Dok. Akad. Nauk SSSR 191 (2) (1970) 279-282. (English transl. in Soviet Mathematics. Doklady, 11 (2) (1970)).
20. Yu. Matiyasevich, Hilbert's tenth problem, Foundations of Computing, MIT Press, Cambridge, MA, 1993.
21. Yu. Matiyasevich, Reduction of trace equations to word equations, 1996. Talk given at the "Colloquium on Computability, Complexity, and Logic", December 5-6, 1996, Institut für Informatik, Universität Stuttgart, Germany.
22. Yu. Matiyasevich, Some decision problems for traces, in: S. Adian, A. Nerode (Eds.), Proc. 4th Internat. Symp. on Logical Foundations of Computer Science (LFCS'97), Yaroslavl, Russia, July 6-12, 1997, Lecture Notes in Computer Science, vol. 1234, Springer, Berlin, 1997, pp. 248-257.
23. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
24. J.-E. Pin, Syntactic semigroups, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 1, Springer, Berlin, 1997, pp. 679-738.
25. K.U. Schulz, Makanin's algorithm for word equations - two improvements and a generalization, in: K.U. Schulz (Ed.), Word Equations and Related Topics, Lecture Notes in Computer Science, vol. 572, Springer, Berlin, 1991, pp. 85-150.
26. H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, Basal, 1994.