The expressibility of languages and relations by word equations

Journal of the ACM

Volumn 47, Issue 3, 2000, Pages 483-505

  Karhumäki, Juhani ^a,b,c,d   Mignosi, Filippo ^a,b,c,d   Plandowski, Wojciech ^a,b,c,d  

^a TURKU UNIVERSITY   (Finland)

^b UNIVERSITY OF PALERMO   (Italy)

^c Turku University   (Finland)

^d TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Word equations

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DECISION MAKING; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FORMAL LANGUAGE THEORY; SYSTEMATIZATION; WORD EQUATIONS;

MATHEMATICAL PROGRAMMING;

EID: 0040073722     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/337244.337255     Document Type: Article

References (18)

1. ANGLUIN, D. 1979. Finding patterns common to a set of strings. In Proceedings of 11th Annual Symposium on the Theory of Computing (STOC'79) (Atlanta, Ga., Apr. 30-May 2). ACM, New York, pp. 130-141.
2. BERSTEL, J., AND PERRIN, D. 1985. Theory of Codes. Academic Press, Orlando, Fla.
3. BÜCHI, R., AND SENGER, S. 1986/87. Coding in the existential theory of concatenation. Arch. Math. Logik, 26, 101-106.
4. BULITKO, V. K. 1970. Equations and inequalities in a free group and a free semi-group. Tul. Gos. Fed. Inst. Ucen. Zap. Mat. Kafedr. Geometr. i Algebra 2, 242-252, (in Russian).
5. CHOFFRUT, C., AND KARHUMAKI, J. 1997. Combinatorics of words. In Handbook of Formal Languages, O. Rozenberg and A. Salomaa, eds. Springer-Verlag, New York, pp. 329-438.
6. CULIK, K., II, AND KARHUMAKI, J. 1983. Systems of equations and Ehrenfeucht's conjecture. Discr. Math. 43, 139-153.
7. EYONO OBONO, S., GORALCIK, P., AND MAKSIMENKO, M. 1994. Efficient solving of the word equations in one variable. In Proceedings of MFCS'94. Lecture Notes in Computer Science, vol. 841. Springer-Verlag, New York, pp. 336-341.
8. HARRISON, M. A. 1978. Introduction to Formal Language Theory. Addison-Wesley Publishing Company, Reading, Mass.
9. JIANG, T., SALOMAA, A., SALOMAA, K., AND YU, S. 1995. Decision problems for patterns, J. Comput. Syst. Sci. 50, 53-63.
10. KARHUMAKI, J., MIGNOSI, F., AND PLANDOWSKI, W. 1997. The expressibility of languages and relations by word equations. In ICALP'97. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 98-109.
11. KHMELEVSKI, YU. I. 1971/1976. Equations in free semigroups, Trudy Mat. Inst. Steklov, 107. (English translation: Proc. Steklov Inst. of Mathematics 107 (1971), American Mathematical Society, Providence, R.I., 1976.)
12. KOSCIELSKl, A., AND PACHOLSKI, L. 1996. Complexity of Makanin's algorithm, J. ACM 43, 4, 670-684.
13. LENTIN, A. 1972. Equations dans des Monoides Libres. Gouthiers-Villars, Paris, France.
14. LOTHAIRE, M. 1983. Combinatorics on Words. Addison-Wesley, Reading, Mass.
15. MAKANIN, G. S. 1977. The problem of solvability of equations in a free semigroup. Mat. Sb. 103, (145), 147-233. (English transl. in Math. U.S.S.R. Sb. 32, 1977.)
16. MATIJASEVICH, Y. 1970/1971. Enumerable sets are diophantine. Soviet. Math. Doklady 11, 354-357. (English translation in Dokl. Akad. Nauk SSSR 191, 279-282, 1971.)
17. ROZENBERG, G., AND SALOMAA, A. 1980. The Mathematical Theory of L Systems, Academic Press, Orlando, Fla.
18. SEIBERT, S. 1992. Quantifier hierarchies and word relations. In Lecture Notes in Computer Science, vol. 626. Springer-Verlag, New York, pp. 329-338.