Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this paper we concentrate on computing cyclic regularities of strings, in particular, we propose several efficient algorithms for computing: (i) cyclic periodicity; (ii) all cyclic periodicity; (iii) maximal local cyclic periodicity; (iv) cyclic covers.
|Title of host publication||Artificial Intelligence Applications and Innovations - AIAI 2019 IFIP WG 12.5 International Workshops|
|Subtitle of host publication||MHDW and 5G-PINE 2019, Proceedings|
|Editors||Ilias Maglogiannis, Lazaros Iliadis, John MacIntyre, Elias Pimenidis|
|Number of pages||5|
|Publication status||Published - 15 May 2019|
|Name||IFIP Advances in Information and Communication Technology|
- Cyclic regularities