Balanced sequences and optimal routing
Journal of the ACM (JACM)
Palindromes and two-dimensional sturmian sequences
Journal of Automata, Languages and Combinatorics
Balance properties of multi-dimensional words
Theoretical Computer Science
Rauzy substitutions and multi-dimensional Sturmian words
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Maximal pattern complexity of two-dimensional words
Theoretical Computer Science
On the language of standard discrete planes and surfaces
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Hi-index | 0.00 |
In the present paper we develop a formalism to generate multi-dimensional words using lattices which generalizes the construction of real numbers (one-dimensional words) from a sequence of partial quotients using continued fractions. The construction was introduced in a special case by Simpson and Tijdeman in order to derive a multi-dimensional generalization of the theorem of Fine and Wilf. We show that the produced multi-dimensional words are intrinsically connected with k-dimensional Sturmian words.