Pages that link to "Item:Q2855577"
From MaRDI portal
The following pages link to A combinatorial proof of \(S\)-adicity for sequences with linear complexity (Q2855577):
Displaying 6 items.
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm (Q477772) (← links)
- Some improvements of the \(S\)-adic conjecture (Q651048) (← links)
- \(S\)-adic conjecture and Bratteli diagrams (Q694692) (← links)
- On sets of indefinitely desubstitutable words (Q2220783) (← links)
- On the linear complexity of multisequences, bijections between \(\mathbb Z\)ahlen and \(\mathbb N\)umber tuples, and partitions (Q2811687) (← links)
- Rigidity and Substitutive Dendric Words (Q4683228) (← links)