A carregar...

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:Entropy (Basel)
Main Authors: Ahmadi, Lida, Ward, Mark Daniel
Formato: Artigo
Idioma:Inglês
Publicado em: MDPI 2020
Assuntos:
Acesso em linha: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: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!