REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS

DOI10.1142/S0129054104002479zbMath1067.68114OpenAlexW2077847146MaRDI QIDQ3022005

Arturo Carpi, Aldo De Luca

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002479

zbMATH Keywords

pictures2D-wordsde Bruijn 2D-wordsfull 2D-wordsuniform 2D-words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Algebraic properties of Parikh matrices of binary picture arrays ⋮ Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words ⋮ Unnamed Item

Cites Work

• Words, univalent factors, and boxes
• On Fine and Wilf's theorem for bidimensional words.
• The complexity of compressing subsegments of images described by finite automata
• Forbidden Factors and Fragment Assembly
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Two-Dimensional Periodicity in Rectangular Arrays
• The Number of Independent Sets in a Grid Graph
• On the distribution of characteristic parameters of words II

This page was built for publication: REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS