The finiteness problem for monoids of morphisms
Juha Honkala
Abstract
Open-access reader
Juha Honkala
Abstract
Open-access reader
We study finitely generated monoids consisting of endomorphisms of a free monoid. We give a necessary and sufficient condition for such a monoid to be infinite and show that this condition is decidable. As a special case we discuss the morphism torsion problem.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We study finitely generated monoids consisting of endomorphisms of a free monoid. We give a necessary and sufficient condition for such a monoid to be infinite and show that this condition is decidable. As a special case we discuss the morphism torsion problem.
Key concepts: Morphism, Monoid, Endomorphism, Decidability, Free monoid, Mathematics, Syntactic monoid, Torsion (gastropod)