Skip to Main content Skip to Navigation
Journal articles

Acyclic, connected and tree sets

Abstract : Given a set S of words, one associates to each word w in S an undi-rected graph, called its extension graph, and which describes the possible extensions of w in S 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 exhibit for this family various connexions between word combinatorics, bifix codes, group automata and free groups. 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 S is acyclic if and only if any bifix code included in S is a basis of the subgroup that it generates.
Document type :
Journal articles
Complete list of metadata
Contributor : Admin Ligm Connect in order to contact the contributor
Submitted on : Monday, March 2, 2015 - 5:10:24 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Sunday, May 31, 2015 - 11:20:36 AM


Files produced by the author(s)



Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. Acyclic, connected and tree sets. Monatshefte für Mathematik, Springer Verlag, 2014, ⟨10.1007/s00605-014-0721-4⟩. ⟨hal-01121887⟩



Record views


Files downloads