Neutral and tree sets of arbitrary characteristic

DOI10.1016/j.tcs.2016.01.008zbMath1355.68214OpenAlexW2291639446MaRDI QIDQ728278

Francesco Dolce, Dominique Perrin

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.008

zbMATH Keywords

interval exchangeslinear involutionsbifix codesneutral setstree sets

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Specular sets ⋮ Suffix-connected languages ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ Rigidity and Substitutive Dendric Words ⋮ Eventually dendric shift spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palindromic complexity of codings of rotations
• Sequences with constant number of return words
• Complexity and special factors
• Bifix codes and Sturmian words
• The finite index basis property
• Bifix codes and interval exchanges
• Acyclic, connected and tree sets
• Maximal bifix decoding
• Return words in Sturmian and episturmian words
• Return words of linear involutions and fundamental groups
• Specular Sets
• Enumeration Formulæ in Neutral Sets
• Orbit structure of interval exchange transformations with flip
• Interval exchange transformations