$\mathcal{S}$-adic characterization of minimal dendric shifts
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange transformations. It is known that any minimal dendric shift...
Saved in:
Main Authors: | France Gheeraert, Julien Leroy |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2025-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | http://dmtcs.episciences.org/13130/pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sorting inversion sequences
by: Toufik Mansour, et al.
Published: (2025-02-01) -
Wreath Macdonald operators
by: Daniel Orr, et al.
Published: (2025-01-01) -
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Marcin Pilipczuk, et al.
Published: (2025-03-01) -
On the on-line coloring of unit interval graphs with proper interval representation
by: Israel R. Curbelo, et al.
Published: (2025-02-01) -
On a nonlinear boundary value problems with impulse action
by: Tleulessova Agila B., et al.
Published: (2025-07-01)