Acyclic, connected and tree sets
From MaRDI portal
Publication:2339363
DOI10.1007/s00605-014-0721-4zbMath1309.68160arXiv1308.4260OpenAlexW2033362178MaRDI QIDQ2339363
Christophe Reutenauer, Dominique Perrin, Giuseppina Rindone, Francesco Dolce, Julien Leroy, Clelia De Felice, Valérie Berthé
Publication date: 31 March 2015
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4260
Combinatorics on words (68R15) Generators, relations, and presentations of groups (20F05) Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05) Symbolic dynamics (37B10)
Related Items (33)
Specular sets ⋮ Codes and Automata in Minimal Sets ⋮ Specular Sets ⋮ Enumeration Formulæ in Neutral Sets ⋮ Perfectly clustering words are primitive positive elements of the free group ⋮ -adic characterization of minimal ternary dendric shifts ⋮ On Morphisms Preserving Palindromic Richness ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ Column representation of Sturmian words in cellular automata ⋮ On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts ⋮ On the group of a rational maximal bifix code ⋮ Suffix-connected languages ⋮ Freeness of Schützenberger groups of primitive substitutions ⋮ Some properties of morphic images of (eventually) dendric words ⋮ Balancedness and coboundaries in symbolic systems ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ A profinite approach to complete bifix decodings of recurrent languages ⋮ On Substitutions Preserving Their Return Sets ⋮ Order Conditions for Languages ⋮ On non-repetitive complexity of Arnoux-Rauzy words ⋮ Return words of linear involutions and fundamental groups ⋮ On balanced sequences and their asymptotic critical exponent ⋮ Interval exchanges, admissibility and branching Rauzy induction ⋮ A geometric interpretation of the Schützenberger group of a minimal subshift ⋮ On the zero defect conjecture ⋮ The finite index basis property ⋮ Rigidity and Substitutive Dendric Words ⋮ Neutral and tree sets of arbitrary characteristic ⋮ Maximal bifix decoding ⋮ Topological methods for symbolic discrepancy ⋮ Eventually dendric shift spaces ⋮ On balanced sequences and their critical exponent ⋮ Almost everywhere balanced sequences of complexity \(2n + 1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Palindromic richness for languages invariant under more symmetries
- Substitutions in dynamics, arithmetics and combinatorics
- Sequences with constant number of return words
- A unique ergodicity of minimal symbolic flows with linear block growth
- Une topologie du monoide libre
- Non-ergodic interval exchange transformations
- Complexity and special factors
- Combinatorial group theory.
- Stallings foldings and subgroups of free groups
- Bifix codes and Sturmian words
- Rational subsets of groups
- The finite index basis property
- Bifix codes and interval exchanges
- Maximal bifix decoding
- Return words in Sturmian and episturmian words
This page was built for publication: Acyclic, connected and tree sets