COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS

DOI10.1142/S0218196791000158MaRDI QIDQ3994320zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• Some combinatorial properties of infinite words and applications to semigroup theory
• scientific article; zbMATH DE number 4140052
• scientific article; zbMATH DE number 826074
• Shirshov's theorem and \(\omega\)-permutability of semigroups

Cited in

(18)

• Balanced words and dynamical systems
• Monomial algebras
• Growth, unavoidable words, and M. Sapir's conjecture for semigroup varieties.
• Quasi-identities of finite semigroups and symbolic dynamics
• Some combinatorial properties of infinite words and applications to semigroup theory
• Stefano Varricchio (1960-2008)
• Suffix-connected languages
• scientific article; zbMATH DE number 4140052 (Why is no real title available?)
• A combinatorial theorem on p-power-free words and an application to semigroups
• scientific article; zbMATH DE number 4165181 (Why is no real title available?)
• Some applications of a theorem of Shirshov to language theory
• The Universality of Words x r y s in Alternating Groups
• Some combinatorial properties of words in discrete dynamical systems from antisymmetric cubic maps
• Combinatorial properties of infinite words associated with cut-and-project sequences
• Ranking and Unranking k-Subsequence Universal Words
• A division property of the Fibonacci word
• Two combinatorial properties of partitions of the free semigroup into finitely many parts
• On finitely recognizable semigroups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3994320)