On the triplex substitution -- combinatorial properties
From MaRDI portal
Recommendations
Cites work
- Fibonacci morphisms and Sturmian words
- Finite automata in number theory
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 590283 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- Pisot substitutions and Rauzy fractals
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Représentation géométrique de suites de complexité 2n+1
- Sequences with subword complexity \(2n\)
- Some remarks on invertible substitutions on three letter alphabet.
- Substitutions in dynamics, arithmetics and combinatorics
- The structure of invertible substitutions on a three-letter alphabet
- Uniform tag sequences
Cited in
(4)
This page was built for publication: On the triplex substitution -- combinatorial properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943630)