Prefix frequency of lost positions (Q2358696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6731770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prefix frequency of lost positions |
scientific article; zbMATH DE number 6731770 |
Statements
Prefix frequency of lost positions (English)
0 references
15 June 2017
0 references
A new and fresh attempt to estimate the number of runs in words over the binary alphabet is presented in this paper. The abstract is easy to follow, however, the author provides additional evidence towards a quick generalized appreciation of the paper's topic. The innovation of the paper is clearly stated. The background theory is fully connected to the given data and the method analysis. Limitations of the proposed method are clearly presented, as well as lemmas and theorems and their corresponding proofs. Tables are presented in an effective manner and are clearly related to the research questions. Data provided support the algorithm's implementation efficiency as well as the conclusions drawn. Different assumptions can lead to various future directions of research on the topic.
0 references
runs
0 references
Lyndon words
0 references
periodicity
0 references
0.7146171927452087
0 references
0.7125205397605896
0 references
0.7093946933746338
0 references
0.7075415253639221
0 references
0.7063168883323669
0 references
