Skip to main content
Conference Proceedings

On the relation between periodicity and unbordered factors of finite words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5257 LNCS 408-418
DOI: 10.1007/978-3-540-85780-8_32
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose k

Cite

CITATION STYLE

APA

Holub, Š., & Nowotka, D. (2008). On the relation between periodicity and unbordered factors of finite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 408–418). https://doi.org/10.1007/978-3-540-85780-8_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free