On uniformly repetitive semigroups
From MaRDI portal
Publication:1328454
DOI10.1007/BF02573477zbMath0805.20052MaRDI QIDQ1328454
Giuseppe Pirillo, Stefano Varricchio
Publication date: 8 February 1995
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/135340
free semigroup; factorization; finite alphabet; free monoid; repetitive semigroups; uniform \(k\)-power; uniformly \(k\)-repetitive semigroup
Related Items
Avoiding or Limiting Regularities in Words, Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$, Avoidability of Additive Cubes over Alphabets of Four Numbers, Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability, A powerful abelian square-free substitution over 4 letters, On abelian 2-avoidable binary patterns, Thue type problems for graphs, points, and numbers, On the additive complexity of a Thue-Morse-like sequence, Mesosome avoidance, Stefano Varricchio (1960-2008), Permutations destroying arithmetic structure, AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY, Avoiding Three Consecutive Blocks of the Same Size and Same Sum
Cites Work
- Properties of integers and finiteness conditions for semigroups
- Two combinatorial properties of partitions of the free semigroup into finitely many parts
- On a natural extension of Jacob's ranks
- Strongly non-repetitive sequences and progression-free sets
- An interesting combinatorial method in the theory of locally finite semigroups
- Sur une construction de Bruck et Reilly. (On a construction of Bruck and Reilly.)
- Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
- Characterization of the repetitive commutative semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
