Equations in the Partial Semigroup of Words with Overlapping Products
We consider an overlapping product of words as a partial operation where the product of two words is defined when the former ends with the same letter as the latter starts, and in this case the product is obtained by merging these two occurrences of letters, for example aba ∙ ab = abab. Some basic results on equations of words are established by reducing them to corresponding results of ordinary word equations.
Keywordscombinatorics on words overlapping product equations
Unable to display preview. Download preview PDF.
- 2.Büchi, J.R., Senger, S.: Coding in the existential theory of concatenation. Arch. Math. Logik Grundlag. 26, 101–106 (1986/1987)Google Scholar
- 3.Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 329–438. Springer (1997)Google Scholar
- 9.Harju, T., Karhumäki, J., Plandowski, W.: Independent systems of equations. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, ch. 13, pp. 443–472. Cambridge University Press (2002)Google Scholar
- 13.Lothaire, M.: Combinatorics on words. Addison-Wesley (1983)Google Scholar
- 15.Makanin, G.S.: The problem of the solvability of equations in a free semigroup. Mat. Sb. (N.S.) 103, 147–236 (1997) (in Russian), English translation in: Math. USSR-Sb. 32, 129–198 (1977)Google Scholar
- 18.Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, New Computing Paradigms. Springer (1998)Google Scholar