Bifix codes and Sturmian words
From MaRDI portal
Publication:1946105
DOI10.1016/j.jalgebra.2012.07.013zbMath1263.68121arXiv1011.5369MaRDI QIDQ1946105
Giuseppina Rindone, Dominique Perrin, Jean Berstel, Clelia De Felice, Christophe Reutenauer
Publication date: 17 April 2013
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.5369
68R15: Combinatorics on words
05A05: Permutations, words, matrices
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
94A45: Prefix, length-variable, comma-free codes
Related Items
Interval exchanges, admissibility and branching Rauzy induction, Rigidity and Substitutive Dendric Words, Eventually dendric shift spaces, A profinite approach to complete bifix decodings of recurrent languages, On Substitutions Preserving Their Return Sets, Recent results on syntactic groups of prefix codes., Neutral and tree sets of arbitrary characteristic, On the group of a rational maximal bifix code, The finite index basis property, Bifix codes and interval exchanges, Acyclic, connected and tree sets, Studies on finite Sturmian words, Specular sets, Maximal bifix decoding, BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS, Return words of linear involutions and fundamental groups, Codes and Automata in Minimal Sets, On Arithmetic Progressions in the Generalized Thue-Morse Word, Specular Sets, Enumeration Formulæ in Neutral Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent results on syntactic groups of prefix codes.
- Transitivity and connectivity of permutations
- On factorially balanced sets of words
- Completing codes in a sofic shift
- Codes and local constraints
- Substitution dynamical systems. Spectral analysis
- Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\)
- Cyclic renewal systems
- Indecomposable permutations, hypermaps and labeled Dyck paths
- Finite biprefix sets of paths in a graph
- Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)
- Primitives in the free group on two generators
- Une topologie du monoide libre
- Descendants of primitive substitutions
- Sturmian morphisms and Rauzy's rules
- A characterization of substitutive sequences using return words
- Sturmian words: structure, combinatorics, and their arithmetics
- Combinatorial group theory.
- Stallings foldings and subgroups of free groups
- Episturmian words and episturmian morphisms
- On syntactic groups.
- Rational subsets of groups
- Continued fractions and the Markoff tree
- Words derivated from Sturmian words
- Codes of central Sturmian words
- Codes and sofic constraints
- Markoff forms and primitive words
- Return words in Sturmian and episturmian words
- EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
- Représentation géométrique de suites de complexité $2n+1$
- Two-way string-matching
- Ensembles libres de chemins dans un graphe
- The Construction of Decimals Normal in the Scale of Ten
- Episturmian words: a survey
- Sur un algorithme donnant les codes bipréfixes finis
- On a Special Class of Recurrent Events
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Subgroups of Finite Index in Free Groups
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy
