COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
From MaRDI portal
Publication:3994320
DOI10.1142/S0218196791000158zbMath0757.20016MaRDI QIDQ3994320
Stefano Varricchio, Aldo De Luca
Publication date: 13 August 1992
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
bi-ideal sequences; \(n\)-divided sequences; finiteness condition for finitely generated semigroups; uniformly recurrent infinite words
20M05: Free semigroups, generators and relations, word problems
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
A division property of the Fibonacci word, On finitely recognizable semigroups, Balanced words and dynamical systems, Monomial algebras, Quasi-identities of finite semigroups and symbolic dynamics, Some combinatorial properties of infinite words and applications to semigroup theory, Stefano Varricchio (1960-2008)