6533b83afe1ef96bd12a7b9d
RESEARCH PRODUCT
On Fine and Wilf's theorem for bidimensional words
Filippo MignosiAntonio RestivoPedro V. Silvasubject
CombinatoricsLarge classDiscrete mathematicsGeneral Computer ScienceGeneralizationRegular polygonParallelogramWord (group theory)MathematicsTheoretical Computer ScienceComputer Science(all)description
AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-01-01 | Theoretical Computer Science |