On Fine and Wilf's theorem for bidimensional words.
From MaRDI portal
Publication:1853743
DOI10.1016/S0304-3975(01)00226-2zbMath1064.68075OpenAlexW1985741809MaRDI QIDQ1853743
Pedro V. Silva, Filippo Mignosi, Antonio Restivo
Publication date: 22 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00226-2
Related Items (12)
On a conjecture on bidimensional words. ⋮ Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester ⋮ On a special class of primitive words ⋮ Periodicity in rectangular arrays ⋮ Fine and Wilf words for any periods ⋮ REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS ⋮ Generalised fine and Wilf's theorem for arbitrary number of periods ⋮ On a Special Class of Primitive Words ⋮ Two-dimensional comma-free and cylindric codes ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ A multidimensional critical factorization theorem ⋮ A periodicity lemma for partial words
Cites Work
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Two-dimensional dictionary matching
- Efficient matching of nonrectangular shapes.
- On a conjecture on bidimensional words.
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Two-Dimensional Periodicity in Rectangular Arrays
- Uniqueness Theorems for Periodic Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Fine and Wilf's theorem for bidimensional words.
