Suffix-connected languages

@article{GouletOuellet2022SuffixconnectedL,
  title={Suffix-connected languages},
  author={Herman Goulet-Ouellet},
  journal={Theor. Comput. Sci.},
  year={2022},
  volume={923},
  pages={126-143}
}
Inspired by a series of papers initiated in 2015 by Berthé et al., we introduce a new condition called suffix-connectedness. We show that the groups generated by the return sets of a uniformly recurrent suffix-connected language lie in a single conjugacy class of subgroups of the free group. Moreover, the rank of the subgroups in this conjugacy class only depends on the number of connected components in the extension graph of the empty word. We also show how to explicitly compute a… 
View PDF on arXiv

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES
Neutral and tree sets of arbitrary characteristic
A geometric interpretation of the Schützenberger group of a minimal subshift
The first author has associated in a natural way a profinite group to each irreducible subshift. The group in question was initially obtained as a maximal subgroup of a free profinite semigroup. In…
Acyclic, connected and tree sets
TLDR
It is proved that in a uniformly recurrent tree set, the sets of first return words are bases of the free group on the alphabet.
Eventually dendric shift spaces
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural…
Fundamental groups,inverse schützenberger automata,and monoid presentations
This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an…
Substitutions in dynamics, arithmetics, and combinatorics
Basic notions on substitutions.- Basic notions on substitutions.- Arithmetics and combinatorics of substitutions.- Substitutions, arithmetic and finite automata: an introduction.- Automatic sequences…
Computations for Symbolic Substitutions
TLDR
A check to verify that no counterexample exists to the so-called "strong coincidence conjecture" for a large number of substitutions on three and four letters is implemented.
Graph Theory with Applications
TLDR
The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square.
Specular sets
FUNDAMENTAL GROUPS
Here are the notes I am taking for Johan de Jong’s ongoing course on étale fundamental groups offered at Columbia University in Fall 2015 (MATH G4263: Topics in Algebraic Geometry). Due to my own…
...
...