Acyclic, connected and tree sets

Abstract

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words defined by the property of the extension graph of each word in the set to be acyclic or connected or a tree. We prove that in a uniformly recurrent tree set, the sets of first return words are bases of the free group on the alphabet. Concerning acyclic sets, we prove as a main result that a set $F$ is acyclic if and only if any bifix code included in $F$ is a basis of the subgroup that it generates.

arXiv admin note: substantial text overlap with arXiv:1305.0127, arXiv:1011.5369, Monatsh. Math. (2015)

References in corpus (1)

• Rational subsets of groups

Cited by in corpus (18)

• A Set of Sequences of Complexity $2n+1$
• A geometric interpretation of the Schützenberger group of a minimal subshift
• Almost everywhere balanced sequences of complexity $2n+1$
• Return words of linear involutions and fundamental groups
• On balanced sequences and their critical exponent
• Fixed points of Sturmian morphisms and their derivated words
• Multifractal Properties of Tribonacci Chains
• On the group of a rational maximal bifix code
• Suffix-connected languages
• Freeness of Schützenberger groups of primitive substitutions
• On The Dimension Group of Unimodular S-Adic Subshifts
• On the Zero Defect Conjecture
• Profinite semigroups
• Obstructions to return preservation for episturmian morphisms
• Stability properties for subgroups generated by return words
• Some conjectures on codes
• A profinite approach to complete bifix decodings of recurrent languages
• Balancedness and coboundaries in symbolic systems