Abstract
Notions related to repetitive substructures in two-dimensional arrays are introduced and studied in an attempt to parallel some of the analogous developments already known for strings. In particular, sequences of “Fibonacci arrays” are defined, capable of exhibiting extremal properties in terms of certain repetitive subpatterns called “tandems”. Two types of tandems are considered. For one type, it is shown that the number of occurrences in an m×n Fibonacci array attains the general upper bound of O (m 2n logn) .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
