scientific article; zbMATH DE number 1400043

zbMath0971.68123MaRDI QIDQ4939596

Julien Cassaigne

Publication date: 2 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Sturmian sequencesblock-complexitycomplexity of two-dimensional sequencesconjecture of Nivat

Mathematics Subject Classification ID

Combinatorics on words (68R15) Special sequences and polynomials (11B83)

Related Items (13)

On a conjecture on bidimensional words. ⋮ Digital planarity -- a review ⋮ Periodicity and local complexity ⋮ Maximal pattern complexity of higher dimensional words ⋮ Double sequences of low complexity ⋮ Infinite labeled trees: from rational to Sturmian trees ⋮ Plane digitization and related combinatorial problems ⋮ Maximal pattern complexity of two-dimensional words ⋮ Strong cocycle triviality for \(Z^{2}\) subshifts ⋮ Aperiodic two-dimensional words of small abelian complexity ⋮ Recurrence along directions in multidimensional words ⋮ Optimal discovery of repetitions in 2D ⋮ Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture

This page was built for publication: