Makanin's algorithm is not primitive recursive

Theoretical Computer Science

Volumn 191, Issue 1-2, 1998, Pages 145-156

  Kościelski, Antoni ^a   Pacholski, Leszek ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013365396     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00321-0     Document Type: Article

References (20)

1. H. Abdulrab and J.P. Pecuchet, Solving word equations, J. Symbolic Comput. 8 (1989) 499-521.
2. S.I. Adyan and G.S. Makanin, Investigation on algorithmic questions of algebra, Trudy Matem. Inst. Steklova 168 (1984) 197-217 (in Russian). English translation in Proc. Steklov Inst. Math. 3 (1986) 207-226.
3. S.I. Adyan and G.S. Makanin, Investigation on algorithmic questions of algebra, Trudy Matem. Inst. Steklova 168 (1984) 197-217 (in Russian). English translation in Proc. Steklov Inst. Math. 3 (1986) 207-226.
4. J. Jaffar, Minimal and complete word unification, J. Assoc. Comput. Mach. 37 (1990) 47-85.
5. Yu.I. Khmelevskiǐ, Solution of word equations in three unknowns, Dokl. Akad. Nauk SSSR 177 (1967) 1023-1025 (in Russian).
6. A. Kościelski, An analysis of Makanin's algorithm deciding solvability of equations in free groups, in: K. Schultz, ed., Word Equations and Related Topics, Lecture Notes in Computer Science, Vol. 572 (Springer, Berlin, 1990) 12-60.
7. A. Kościelski and L. Pacholski, Complexity of Makanin's algorithm, J. Assoc. Comput. Mach. 43 (1996) 670-684.
8. A. Kościelski and L. Pacholski, Complexity of unification in free groups and free semigroups, in: Proc. 31st Ann. IEEE Symp. on Foundations of Computer Science, Los Alamitos (1990) 824-829.
9. A. Lentin, Equations in free monoids, in Nivat, ed., Automata, Languages and Programming (1972) 67-85.
10. G.S. Makanin, The problem of solvability of equations in a free semigroup, Mat. Sbornik 103 (1977) 147-236 (in Russian). English translation in Math. USSR Sbornik 32 (1977) 129-198.
11. G.S. Makanin, The problem of solvability of equations in a free semigroup, Mat. Sbornik 103 (1977) 147-236 (in Russian). English translation in Math. USSR Sbornik 32 (1977) 129-198.
12. G.S. Makanin, Equations in a free group, Izvestiya AN SSSR 46 (1982) 1199-1273 (in Russian). English translation in Math. USSR Izvestiya 21 (1983) 483-546.
13. G.S. Makanin, Equations in a free group, Izvestiya AN SSSR 46 (1982) 1199-1273 (in Russian). English translation in Math. USSR Izvestiya 21 (1983) 483-546.
14. G.S. Makanin, Decidability of the universal and positive theories of a free group, Izvestiya AN SSSR 48 (1984) 735-749 (in Russian). English translation in Math. USSR Izvestiya 25 (1985) 75-88.
15. G.S. Makanin, Decidability of the universal and positive theories of a free group, Izvestiya AN SSSR 48 (1984) 735-749 (in Russian). English translation in Math. USSR Izvestiya 25 (1985) 75-88.
16. J.P. Pecuchet, Solutions principales et rang d'un système d'équations avec constantes dans le monoïde libre, Discrete Math. 48 (1984) 253-274.
17. G. Plotkin, Building in equational theories, Machine Intelligence 7 (1972) 73-90.
18. A.A. Razborov, On systems of equations in a free group, Izvestiya AN SSSR 48 (1984) 779-832 (in Russian). English translation in Math. USSR Izvestiya 25 (1985) 115-162.
19. A.A. Razborov, On systems of equations in a free group, Izvestiya AN SSSR 48 (1984) 779-832 (in Russian). English translation in Math. USSR Izvestiya 25 (1985) 115-162.
20. K.U. Schulz, Word unification and transformation of generalized equations, J. Automated Reasoning 11 (1993) 149-184.