In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed ("cut") as a curve crosses a square grid.[1]
Sturmian words are a special case of cutting sequences where the curves are straight lines of irrational slope.[2]
References
edit- Notes
- Bibliography
- Pytheas Fogg, N. (2002). Berthé, Valérie; Ferenczi, Sébastien; Mauduit, Christian; Siegel, A. (eds.). Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics. Vol. 1794. Berlin: Springer-Verlag. ISBN 3-540-44141-7. Zbl 1014.11015.
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |