Maximal bifix decoding

DOI10.1016/j.disc.2014.12.010zbMath1309.68159arXiv1308.5396OpenAlexW2052869910MaRDI QIDQ2514159

Francesco Dolce, Christophe Reutenauer, Giuseppina Rindone, Julien Leroy, Clelia De Felice, Dominique Perrin, Valérie Berthé

Publication date: 30 January 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5396

zbMATH Keywords

symbolic dynamicscombinatorics on wordsuniformly recurrent tree sets: bifix decoding

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (22)

Specular sets ⋮ Codes and Automata in Minimal Sets ⋮ Enumeration Formulæ in Neutral Sets ⋮ -adic characterization of minimal ternary dendric shifts ⋮ On Morphisms Preserving Palindromic Richness ⋮ On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts ⋮ On the group of a rational maximal bifix code ⋮ Freeness of Schützenberger groups of primitive substitutions ⋮ Some properties of morphic images of (eventually) dendric words ⋮ Balancedness and coboundaries in symbolic systems ⋮ A profinite approach to complete bifix decodings of recurrent languages ⋮ On Substitutions Preserving Their Return Sets ⋮ Return words of linear involutions and fundamental groups ⋮ Interval exchanges, admissibility and branching Rauzy induction ⋮ A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid ⋮ The finite index basis property ⋮ Bifix codes and interval exchanges ⋮ Rigidity and Substitutive Dendric Words ⋮ Neutral and tree sets of arbitrary characteristic ⋮ Recognizability for sequences of morphisms ⋮ Eventually dendric shift spaces ⋮ Acyclic, connected and tree sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bispecial factors in circular non-pushy D0L languages
• Substitutions in dynamics, arithmetics and combinatorics
• Weak mixing and eigenvalues for Arnoux-Rauzy sequences
• Complexity and special factors
• A characterization of substitutive sequences using return words
• The structure of invertible substitutions on a three-letter alphabet
• Bifix codes and Sturmian words
• The finite index basis property
• Bifix codes and interval exchanges
• Acyclic, connected and tree sets
• Return words in Sturmian and episturmian words
• Languages of k -interval exchange transformations
• Représentation géométrique de suites de complexité $2n+1$
• Deviation for interval exchange transformations
• Rank and symbolic complexity
• An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
• Episturmian words: a survey
• SMALL DENOMINATORS AND PROBLEMS OF STABILITY OF MOTION IN CLASSICAL AND CELESTIAL MECHANICS
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories
• Interval exchange transformations

This page was built for publication: Maximal bifix decoding