Combinatorics of patterns of a bidimensional Sturmian sequence.
Theoretical Computer Science
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Digital lines with irrational slopes
Theoretical Computer Science
Functional stepped surfaces, flips, and generalized substitutions
Theoretical Computer Science
Local rule substitutions and stepped surfaces
Theoretical Computer Science
On some applications of generalized functionality for arithmetic discrete planes
Image and Vision Computing
On the language of standard discrete planes and surfaces
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Bidimensional sturmian sequences and substitutions
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Generalized functionality for arithmetic discrete planes
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Consistency of multidimensional combinatorial substitutions
Theoretical Computer Science
Hi-index | 0.00 |
Iterated morphisms of the free monoid are very simple combinatorial objects which produce infinite sequences by replacing iteratively letters by words. The aim of this paper is to introduce a formalism for a notion of two-dimensional morphisms; we show that they can be iterated by using local rules, and that they generate two-dimensional patterns related to discrete approximations of irrational planes with algebraic parameters. We associate such a two-dimensional morphism with any usual Pisot unimodular one-dimensional iterated morphism over a three-letter alphabet.