ON ABELIAN POWER-FREE MORPHISMS

DOI10.1142/S0218196793000123zbMath0784.20029OpenAlexW2060062102MaRDI QIDQ3141774

Arturo Carpi

Publication date: 1 November 1993

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196793000123

zbMATH Keywords

finite languagepower-free wordsabelian square-free wordsconsecutive factorsmorphisms of free monoidspower-free morphisms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Mappings of semigroups (20M15)

Related Items (13)

A powerful abelian square-free substitution over 4 letters ⋮ On the number of Abelian square-free words on four letters ⋮ Abelian combinatorics on words: a survey ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding abelian powers cyclically ⋮ On some generalizations of abelian power avoidability ⋮ Relations on words ⋮ Avoiding 2-binomial squares and cubes ⋮ Growth of repetition-free words -- a review ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Unnamed Item ⋮ Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ ⋮ On Abelian squares and substitutions

This page was built for publication: ON ABELIAN POWER-FREE MORPHISMS