Acyclic, connected and tree sets

From MaRDI portal
Publication:2339363

DOI10.1007/s00605-014-0721-4zbMath1309.68160arXiv1308.4260OpenAlexW2033362178MaRDI QIDQ2339363

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

Publication date: 31 March 2015

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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




Related Items (33)

Specular setsCodes and Automata in Minimal SetsSpecular SetsEnumeration Formulæ in Neutral SetsPerfectly clustering words are primitive positive elements of the free group-adic characterization of minimal ternary dendric shiftsOn Morphisms Preserving Palindromic RichnessFixed points of Sturmian morphisms and their derivated wordsColumn representation of Sturmian words in cellular automataOn the dimension group of unimodular \(\mathcal{S}\)-adic subshiftsOn the group of a rational maximal bifix codeSuffix-connected languagesFreeness of Schützenberger groups of primitive substitutionsSome properties of morphic images of (eventually) dendric wordsBalancedness and coboundaries in symbolic systemsDerived sequences of complementary symmetric Rote sequencesA profinite approach to complete bifix decodings of recurrent languagesOn Substitutions Preserving Their Return SetsOrder Conditions for LanguagesOn non-repetitive complexity of Arnoux-Rauzy wordsReturn words of linear involutions and fundamental groupsOn balanced sequences and their asymptotic critical exponentInterval exchanges, admissibility and branching Rauzy inductionA geometric interpretation of the Schützenberger group of a minimal subshiftOn the zero defect conjectureThe finite index basis propertyRigidity and Substitutive Dendric WordsNeutral and tree sets of arbitrary characteristicMaximal bifix decodingTopological methods for symbolic discrepancyEventually dendric shift spacesOn balanced sequences and their critical exponentAlmost everywhere balanced sequences of complexity \(2n + 1\)




Cites Work




This page was built for publication: Acyclic, connected and tree sets