Abstract
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.
Supported by the Academy of Finland under the grant 121419.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci. 41, 121–123 (1985)
Büchi, J.R., Senger, S.: Coding in the existential theory of concatenation. Arch. Math. Logik Grundlag. 26, 101–106 (1986/1987)
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)
Csuhaj-Varjú, E., Petre, I., Vaszil, G.: Self-assembly of strings and languages. Theoret. Comput. Sci. 374, 74–81 (2007)
Cărăuşu, A., Păun, G.: String intersection and short concatenation. Revue Roumaine de Mathématiques Pures et Appliquées 26, 713–726 (1981)
Domaratzki, M.: Semantic Shuffle on and Deletion Along Trajectories. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 163–174. Springer, Heidelberg (2004)
Domaratzki, M.: Minimality in Template-Guided Recombination. Information and Computation 207, 1209–1220 (2009)
Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Mat. Zametki 40, 321–324 (1986) (in Russian)
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)
Holzer, M., Jakobi, S.: Chop Operations and Expressions: Descriptional Complexity Considerations. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 264–275. Springer, Heidelberg (2011)
Ito, M., Lischke, G.: Generalized periodicity and primitivity. Mathematical Logic Quarterly 53, 91–106 (2007)
Karhumäki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47, 483–505 (2000)
Lothaire, M.: Combinatorics on words. Addison-Wesley (1983)
Lyndon, R.C., Schützenberger, M.P.: The equation aM = bNcP in a free group. Michigan Math. J. 9, 289–298 (1962)
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)
Mateescu, A., Păun, G., Rozenberg, G., Salomaa, A.: Simple splicing systems. Discrete Applied Mathematics 84, 145–162 (1998)
Mateescu, A., Salomaa, A.: Parallel composition of words with re-entrant symbols. Analele Universităţii Bucureşti Mathematică-Informatică 45, 71–80 (1996)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, New Computing Paradigms. Springer (1998)
Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51, 483–496 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Huova, M., Karhumäki, J. (2012). Equations in the Partial Semigroup of Words with Overlapping Products. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)