On word equations in one variable

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

Volumn 2420, Issue , 2002, Pages 212-220

  Dąbrowski, Robert ^a   Plandowski, Wojtek ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

PRIMITIVE WORD; RESOLUTION ALGORITHMS; TIME COMPLEXITY; WORD EQUATIONS;

ARTIFICIAL INTELLIGENCE;

EID: 35048824095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_17     Document Type: Conference Paper

References (15)

1. Angluin D., Finding pattern common to a set of string, in Proc. STOC’79, 130-141, 1979.
2. Charatonik W., Pacholski L., Word equations in two variables, Proc. IWWERT’91, LNCS 677, 43-57, 1991.
3. Crochemore M., Rytter W., Text Algorithms, Oxford University Press, 1994.
4. Crochemore M., Rytter W., Periodic suffixes of strings, in: Acts of Sequences, 1991.
5. Diekert V., Makanin’s algorithm, a chapter in a book on combinatorics of words, 1998, personal comunication (Volker.Diekert@informatik.uni-stuttgart.de).
6. Jaffar J., Minimal and complete word unification, Journal of the ACM 37(1), 47-85, 1990.
7. Eyono Obono S., Goralcik P., Maksimienko M., Efficient Solving of theWord Equations in One Variable, Lecture Notes in Computer Science 841, Springer Verlag, Proc. of the 19th International Symposium MFCS 1994, Kosice, Slovakia, 336-341, Springer, 1994.
8. Gutierrez C., Satisfiability of word equations with constants is in exponential space, in: Proc. FOCS’98, IEEE Computer Society Press, Palo Alto, California.
9. Ilie L., Plandowski W., Two-variable word equations, RAIRO Theoretical Informatics and Applications 34, 467-501, 2000.
10. Koscielski A., Pacholski L., Complexity of Makanin’s Algorithm, Journal of the ACM 43(4), 670-684, 1996.
11. Makanin G. S., The problem of solvability of equations in a free semigroup, Mat. Sb., 103(2), 147-236. In Russian; English translation in: Math. USSR Sbornik, 32, 129-198, 1977.
12. Neraud J., Equations in words: an algorithmic contribution, Bull. Belg. Math. Soc., 1, 253-283, 1994.
13. Plandowski W., Rytter W., Application of Lempel-Ziv encodings to the solution of word equations, in: Proc. ICALP’98, LNCS 1443, 731-742, 1998.
14. Plandowski W., Satisfiability of word equations with constants is in NEXPTIME, Proc. STOC’99, 721-725, ACM Press, 1999.
15. Plandowski W., Satisfiability of word equations with constants is in PSPACE, Proc. FOCS’99, 495-500, IEEE Computer Society Press, 1999.