Abstract
The finite state wreath power of a transformation semigroup is introduced. It is proved that the finite state wreath power of nontrivial semigroup is not finitely generated and in some cases even does not contain irreducible generating systems. The free product of two monogenic semigroups of index 1 and period m is constructed in the finite state wreath power of corresponding monogenic monoid.
Similar content being viewed by others
References
Gecseg, F., Peák, I.: Algebraic Theory of Automata. Akad. Kiadó, Budapest (1972)
Eilenberg, S.: Automata, Languages, and Machines. Vol. A. Academic Press, San Diego (1974)
Grigorchuk, R.I., Nekrashevych, V.V., Sushchansky, V.I.: Automata, dynamical systems and groups. Proc. Steklov Inst. Math. 231, 134–215 (2000)
Rhodes, J., Steinberg, B.: The q-theory of Finite Semigroups. Springer Monographs in Mathematics. Springer, New York (2009)
Dömösi, P., Nehaniv, C.L.: Algebraic Theory of Automata Networks: An Introduction. SIAM, Philadelphia (2005)
Cvetko-Vah, K., Kokol Bukovšek, D., Košir, T., Kudryavtseva, G., Lavrenyuk, Y., Oliynyk, A.: Semitransitive subsemigroups of the symmetric inverse semigroups. Semigroup Forum 78, 138–147 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Benjamin Steinberg.
Rights and permissions
About this article
Cite this article
Oliynyk, A.S. Finite state wreath powers of transformation semigroups. Semigroup Forum 82, 423–436 (2011). https://doi.org/10.1007/s00233-011-9292-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-011-9292-z