Presentations of Schützenberger groups of minimal subshifts.
DOI10.1007/S11856-012-0139-4zbMATH Open1293.20054arXiv1001.1475OpenAlexW2166698119MaRDI QIDQ375868FDOQ375868
Publication date: 1 November 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.1475
symbolic dynamicsprofinite groupssymbolic dynamical systemssubshifts\(\mathcal J\)-classesfree profinite semigroupsprojective limits of finite semigroupspseudovarieties of semigroupsSchützenberger groups
Limits, profinite groups (20E18) Symbolic dynamics (37B10) Structure of topological semigroups (22A15) Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07)
Cites Work
- Power of words and recognizability of fixpoints of a substitution
- Title not available (Why is that?)
- An Introduction to Symbolic Dynamics and Coding
- A characterization of substitutive sequences using return words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Substitutions in dynamics, arithmetics and combinatorics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- Sequences with constant number of return words
- Some remarks on subgroups defined by the Bohr compactification
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- Profinite groups associated to sofic shifts are free
- Title not available (Why is that?)
- Closed subgroups of free profinite monoids are projective profinite groups
- On the periodicity of morphisms on free monoids
- Irreducibility of certain pseudovarieties1
- Decidability of periodicity for infinite words
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- Projective Profinite Groups
- Pro-finite presentations
- Maximal subgroups of the minimal ideal of a free profinite monoid are free.
Cited In (13)
- On subshift presentations
- On Substitutions Preserving Their Return Sets
- A geometric interpretation of the Schützenberger group of a minimal subshift
- Codes and Automata in Minimal Sets
- Free profinite locally idempotent and locally commutative semigroups
- Recognizability for sequences of morphisms
- On the group of a rational maximal bifix code
- Obstructions to return preservation for episturmian morphisms
- Profinite topologies
- Pronilpotent quotients associated with primitive substitutions
- Freeness of Schützenberger groups of primitive substitutions
- The Karoubi envelope of the mirage of a subshift
- A profinite approach to complete bifix decodings of recurrent languages
Uses Software
This page was built for publication: Presentations of Schützenberger groups of minimal subshifts.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375868)