Skip to Main content Skip to Navigation
Conference papers

On the Cyclic Regularities of Strings

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Thursday, November 14, 2019 - 3:50:58 PM
Last modification on : Wednesday, October 28, 2020 - 2:20:04 PM
Long-term archiving on: : Saturday, February 15, 2020 - 4:31:16 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Oluwole Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas Iliopoulos, et al.. On the Cyclic Regularities of Strings. 15th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), May 2019, Hersonissos, Greece. pp.219-224, ⟨10.1007/978-3-030-19909-8_19⟩. ⟨hal-02363851⟩



Record views