2015RAIRO - Theoretical Informatics and ApplicationsOpen access

The finiteness problem for monoids of morphisms

Juha Honkala

Open full text 1 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
The finiteness problem for monoids of morphisms — Research Paper | ScholarLens