A linearly computable measure of string complexity
We present a measure of string complexity, called I-complexity, computable in linear time and space. It counts the number of different substrings in a given string. The least complex strings are the runs of a single symbol, the most complex are the de Bruijn strings. Although the I-complexity of a s...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/190842 |
| Acesso em linha: | http://hdl.handle.net/11336/190842 |
| Access Level: | acceso abierto |
| Palavra-chave: | KOLMOGOROV COMPLEXITY STRINGOLOGY DE BRUIJN STRINGS COMBINATORIAL PROPERTIES OF STRINGS https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Resumo: | We present a measure of string complexity, called I-complexity, computable in linear time and space. It counts the number of different substrings in a given string. The least complex strings are the runs of a single symbol, the most complex are the de Bruijn strings. Although the I-complexity of a string is not the length of any minimal description of the string, it satisfies many basic properties of classical description complexity. In particular, the number of strings with I-complexity up to a given value is bounded, and most strings of each length have high I-complexity. |
|---|