Makanin's algorithm for solving word equations with regular constraints
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[2] George Markowsky. Bounds on the index and period of a binary relation on a finite set , 1976 .
[3] G. Makanin. DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP , 1985 .
[4] G. Makanin. EQUATIONS IN A FREE GROUP , 1983 .
[5] G S Makanin. RECOGNITION OF THE RANK OF EQUATIONS IN A FREE SEMIGROUP , 1980 .
[6] J. Gathen,et al. A bound on solutions of linear integer equalities and inequalities , 1978 .
[7] G S Makanin. Equations in a free semigroup , 1981 .
[8] Maurice Nivat,et al. Resolution of Equations in Algebraic Structures , 1989 .
[9] A. Razborov. ON SYSTEMS OF EQUATIONS IN A FREE GROUP , 1985 .
[10] Witold Charatonik,et al. Word Equations with Two Variables , 1991, IWWERT.
[11] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .
[12] Klaus U. Schulz,et al. Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.
[13] Anca Muscholl,et al. Solving Trace Equations Using Lexicographical Normal Forms , 1997, ICALP.
[14] Iu I Khmelevskiĭ. Equations in free semigroups , 1976 .
[15] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .
[16] Pavel Goralcik,et al. Efficient Solving of the Word Equations in One Variable , 1994, MFCS.
[17] Leszek Pacholski,et al. Makanin's Algorithm is not Primitive Recursive , 1998, Theor. Comput. Sci..
[18] A. Mazurkiewicz. Concurrent Program Schemes and their Interpretations , 1977 .
[19] JaffarJoxan. Minimal and complete word unification , 1990 .
[20] Yuri V. Matiyasevich. Some Decision Problems for Traces , 1997, LFCS.
[21] Leszek Pacholski,et al. Complexity of Makanin's algorithm , 1996, JACM.
[22] Habib Abdulrab,et al. Solving Word Equations , 1989, J. Symb. Comput..