SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
From MaRDI portal
Publication:5483459
Recommendations
- Maximal subgroups of the minimal ideal of a free profinite monoid are free.
- Closed subgroups of free profinite monoids are projective profinite groups
- Profinite groups associated with weakly primitive substitutions.
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- Profinite groups associated to sofic shifts are free.
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- An Introduction to Symbolic Dynamics and Coding
- Complexity of sequences and dynamical systems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- Homomorphisms of symbolic dynamical systems
- On pseudovarieties
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- Stallings foldings and subgroups of free groups
- Sturmian morphisms and Rauzy's rules
- Subword complexities of various classes of deterministic developmental languages without interactions
- The Birkhoff theorem for finite algebras
- Topology of finite graphs
- Unzerlegbare, nicht negative Matrizen
Cited in
(26)- Iterated periodicity over finite aperiodic semigroups
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- Maximal subgroups of the minimal ideal of a free profinite monoid are free.
- A profinite approach to complete bifix decodings of recurrent languages
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- A combinatorial property of ideals in free profinite monoids.
- Towards a pseudoequational proof theory
- Presentations of Schützenberger groups of minimal subshifts.
- A geometric interpretation of the Schützenberger group of a minimal subshift
- Rational codes and free profinite monoids
- Profinite groups associated with weakly primitive substitutions.
- On the transition semigroups of centrally labeled Rauzy graphs.
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Complexity of the identity checking problem for finite semigroups.
- Free profinite locally idempotent and locally commutative semigroups
- Closed subgroups of free profinite monoids are projective profinite groups
- Relative locations of subwords in free operated semigroups and Motzkin words.
- Pro-aperiodic monoids via saturated models
- On the group of a rational maximal bifix code
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- Profinite topologies
- Pronilpotent quotients associated with primitive substitutions
- On the endomorphism monoid of a profinite semigroup
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- The Karoubi envelope of the mirage of a subshift
This page was built for publication: SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483459)
