Detecting leftmost maximal periodicities (Q1825029): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128090050, #quickstatements; #temporary_batch_1722384924290 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(89)90051-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007378578 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128090050 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting leftmost maximal periodicities |
scientific article |
Statements
Detecting leftmost maximal periodicities (English)
0 references
1989
0 references
A periodicity is a word of the form \(p^ mq\), where q is a prefix of p and \(m\geq 2\). The author gives an efficient algorithm to list the leftmost occurrences of periodicities within a string. This algorithm is linear in time, when the alphabet is known in advance, and of the order O(\(| x| \log | x|)\), if not, where x is the input string. As an application, the author solves several questions raised by Crochemore
0 references
periodic words
0 references
0 references
