Wordt geladen...
Asymptotic Analysis of the kth Subword Complexity
Patterns within strings enable us to extract vital information regarding a string’s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a value that is called the kth Subword Complexity of t...
Bewaard in:
| Gepubliceerd in: | Entropy (Basel) |
|---|---|
| Hoofdauteurs: | , |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI
2020
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7516637/ https://ncbi.nlm.nih.gov/pubmed/33285983 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e22020207 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|