Enumeration Formulæ in Neutral Sets

Abstract : We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural coding of some interval exchange transformations.
Document type :
Book sections
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01367707
Contributor : Francesco Dolce <>
Submitted on : Monday, September 19, 2016 - 5:27:09 PM
Last modification on : Thursday, July 5, 2018 - 2:46:04 PM

File

dlt15.pdf
Files produced by the author(s)

Identifiers

Citation

Francesco Dolce, Dominique Perrin. Enumeration Formulæ in Neutral Sets. Developments in Language Theory, 2015, ⟨10.1007/978-3-319-21500-6_17⟩. ⟨hal-01367707⟩

Share

Metrics

Record views

153

Files downloads

133