SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS

DOI10.1142/S0218196706002883zbMath1186.20040OpenAlexW2169485367MaRDI QIDQ5483459

Mikhail V. Volkov, Jorge Almeida

Publication date: 14 August 2006

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

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

zbMATH Keywords

entropyfinite semigroupspseudovarietiesiterationsfree profinite groupsfree profinite semigroupsimplicit operatorsprofinite wordsgroup-generic endomorphismssubword complexities

Mathematics Subject Classification ID

Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Symbolic dynamics (37B10)

Related Items

Complexity of the identity checking problem for finite semigroups., Pronilpotent quotients associated with primitive substitutions, Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts., Presentations of Schützenberger groups of minimal subshifts., On the group of a rational maximal bifix code, A profinite approach to complete bifix decodings of recurrent languages, Iterated periodicity over finite aperiodic semigroups, ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS, Towards a pseudoequational proof theory, The Karoubi envelope of the mirage of a subshift, A geometric interpretation of the Schützenberger group of a minimal subshift, A combinatorial property of ideals in free profinite monoids., On the endomorphism monoid of a profinite semigroup, Maximal subgroups of the minimal ideal of a free profinite monoid are free., Pro-aperiodic monoids via saturated models, Infinite-vertex free profinite semigroupoids and symbolic dynamics., Representations of relatively free profinite semigroups, irreducibility, and order primitivity, Profinite topologies, CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY

Cites Work

• Unnamed Item
• Unnamed Item
• Topology of finite graphs
• The Birkhoff theorem for finite algebras
• Subword complexities of various classes of deterministic developmental languages without interactions
• On pseudovarieties
• Complexity of sequences and dynamical systems
• Sturmian morphisms and Rauzy's rules
• Stallings foldings and subgroups of free groups
• Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands
• Unzerlegbare, nicht negative Matrizen
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
• An Introduction to Symbolic Dynamics and Coding
• Homomorphisms of symbolic dynamical systems