COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS

DOI10.1142/S0218196791000158zbMath0757.20016OpenAlexW2104004124MaRDI QIDQ3994320

Stefano Varricchio, Aldo De Luca

Publication date: 13 August 1992

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

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

zbMATH Keywords

bi-ideal sequences\(n\)-divided sequencesfiniteness condition for finitely generated semigroupsuniformly recurrent infinite words

Mathematics Subject Classification ID

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

Related Items (7)

Quasi-identities of finite semigroups and symbolic dynamics ⋮ Some combinatorial properties of infinite words and applications to semigroup theory ⋮ A division property of the Fibonacci word ⋮ Stefano Varricchio (1960-2008) ⋮ Balanced words and dynamical systems ⋮ Monomial algebras ⋮ On finitely recognizable semigroups

This page was built for publication: COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS