Some non finitely generated monoids of repetition-free endomorphisms. (Q1853181): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 11:13, 1 February 2024

scientific article
Language Label Description Also known as
English
Some non finitely generated monoids of repetition-free endomorphisms.
scientific article

    Statements

    Some non finitely generated monoids of repetition-free endomorphisms. (English)
    0 references
    0 references
    21 January 2003
    0 references
    We answer a question raised by Mitrana in Information Processing Letters 64 about primitive morphisms, that is, morphisms that preserve primitiveness of words. Given an alphabet \(A\) with \(\text{Card} (A)\geqslant2\), the monoid of primitive endomorphisms on \(A\) and the monoid of primitive uniform endomorphisms on \(A\) are not finitely generated. Moreover we show that it is also the case for the following monoids: the monoid of overlap-free (uniform) endomorphisms on \(A\) (when \(\text{Card} (A)\geqslant3)\), the monoid of \(k\)-power-free (uniform) endomorphisms on \(A\) (when \(\text{Card} (A)\geqslant2\) and \(k\geqslant3)\).
    0 references
    Formal languages
    0 references
    Combinatorics on words
    0 references
    Primitive words
    0 references
    Morphisms
    0 references

    Identifiers