Skip to Main content Skip to Navigation
Journal articles

Tiling Periodicity

Abstract : We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a lozenge b is a tiling period of a a b b. We investigate properties of tiling periodicities and design an algorithm working in O(n log (n) log log (n)) time which finds a tiling period of minimal size, the number of such minimal periods and their compact representation. The combinatorics of tiling periods differs significantly from that for classical full periods, for example unlike the classical case the same word can have many different primitive tiling periods. We consider also a related new type of periods called in the paper multi-periods. As a side product of the paper we solve an open problem posted by T. Harju (2003).
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990466
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:37:50 PM
Last modification on : Monday, June 8, 2020 - 10:54:02 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:10:30 PM

File

1352-5055-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990466, version 1

Collections

Citation

Juhani Karhumaki, Yury Lifshits, Wojciech Rytter. Tiling Periodicity. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (2), pp.237-248. ⟨hal-00990466⟩

Share

Metrics

Record views

104

Files downloads

757