An optimal algorithm for computing the repetitions in a word (Q1155963): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90024-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067787802 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for computing the repetitions in a word |
scientific article |
Statements
An optimal algorithm for computing the repetitions in a word (English)
0 references
1981
0 references
analysis of algorithm
0 references
optimality
0 references
partitioning
0 references
repetition in words
0 references
squarefreeness
0 references
powerfreeness
0 references
Fibonacci words
0 references
