Abstract
LetM be a monoid presented by <Σ;u=v> whereu andv are words on the finite alphabet Σ./ Deciding the world problem forM is still an open question, though it seems decidable and partial results exist. The remaining cases to solve are presentations of the form <a, b; bva=aua>,u, v∈{a, b}⋆ The word problem is then closely related to the left-divisibility problem, as shown by S.I. Adjan who introduced a procedure that “almost” allows to decide the problem. The main contribution, due to Adjan and Oganesjan, states that ifbva is an unbordered factor ofaua then the word problem is deciable. We restrict Adjan's procedure to study the case whenbva is unbordered, which allows us to extend Adjan and Oganesjan's theorem. More specifically, we show (Proposition 4.24) that the word problem is decidable for presentations <a, b; bva=aua> with the only following condition: Inbva, the leftmost train ofb is strictly longer than the others. The following corollary naturally holds: The word problem is decidable for presentations of the form <a, b; b m a n=aua>,u∈{a, b}⋆,m, n>0
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adjan, S. I.,Defining relations and algorithmics problems for groups and semigroups, Trudy Math. Inst. Steklov, Akad. Nauk SSSR85 (1966), 1–124 (Russian).
Adjan, S. I.,On transformations of words in semigroups presented by a system of defining relations, Algebra Logika15, 6 (1976), 611–621 (Russian).
Adjan, S. I., Oganesjan, G. U.,On the problem of equality and divisibility in semigroups with one defining relation, Izv. Akad. Nauk SSSR, Ser. Math42, 2 (1978), 219–225 (Russian).
Adjan, S. I., Oganesjan, G. U.,Problems of equality and divisibility in semigroups with a single defining relation, Matem. Zametki41 (1987), 412–421 (Russian).
Book, R., Otto, F. “String rewriting systems”, Springer Verlag, 1993.
Bouwsma, J., “Semigroups presented by a single relation,” Ph.D., The Pennsylvania State University, 1993.
Berstel, J., Perrin, D., “Theory of codes”, Academic Press, 1985.
Kurth, W., “Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel”, Ph.D., Institut für Mathematik der Technischen Universität Clausthal, 1990.
Lallement, G.,Some algorithms for semigroups and monoids presented by a single relation, Semigroups, Theory and Applications, Proceedings Oberwolfach 1986, Lecture Notes in Mathematics1320 (1988) 176–182.
Lallement, G.,The word problem for Thue systems, to appear in the Proceedings of l'Ecole de Printemps d'Informatique Théorique, “La Réécriture”, 1993.
Magnus, W.,Das Identitäts-Problem für Gruppen mit einer definierenden Relation, Math. Ann.106 (1932), 295–307.
Markov, A. A.,On the impossibility of certain algorithms in the theory of associative systems, Dokl. Akad. Nauk SSSR55, 587–590, and58, 353–356, 1947 (Russian).
Matjasevitch, J.,Simple examples of unsolvable associative calculi, Dokl. Akad. Nauk SSSR173 (1967), 1264–1266 (Russian).
Oganesjan, G. U.,On semigroups with one relation and semigroups without cycle, Izv. Akad. Nauk SSSR, Ser. Mat.46, 1 (1982), 88–94 (Russian).
Post, E. L.,Recursive unsolvability of a problem of Thue, J. of Symbolic Logic12 (1947), 1–11.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Watier, G. Left-divisibility and word problems in single relation monoids. Semigroup Forum 53, 194–207 (1996). https://doi.org/10.1007/BF02574134
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02574134