Affordable Access

Publisher Website

On Fine and Wilf's theorem for bidimensional words

Authors
Journal
Theoretical Computer Science
0304-3975
Publisher
Elsevier
Publication Date
Volume
292
Issue
1
Identifiers
DOI: 10.1016/s0304-3975(01)00226-2
Disciplines
  • Mathematics

Abstract

Abstract Generalizations 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 R 2 which include most parallelograms. A complete discussion is provided for the parallelogram case.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Partial words and a theorem of Fine and Wilf

on Theoretical Computer Science Jan 01, 1999

Partial words and a theorem of Fine and Wilf revis...

on Theoretical Computer Science Jan 01, 2002

Graph connectivity, partial words, and a theorem o...

on Information and Computation Jan 01, 2008

Fine and Wilf's theorem for three periods and a ge...

on Theoretical Computer Science Jan 01, 1999
More articles like this..