A linearly computable measure of string complexity

Autores
Becher, Veronica Andrea; Heiber, Pablo Ariel
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
KOLMOGOROV COMPLEXITY
STRINGOLOGY
DE BRUIJN STRINGS
COMBINATORIAL PROPERTIES OF STRINGS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/190842
Acceder
id CONICETDig_7b56df785d93185df6268eb73e5de11f
oai_identifier_str oai:ri.conicet.gov.ar:11336/190842
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A linearly computable measure of string complexityBecher, Veronica AndreaHeiber, Pablo ArielKOLMOGOROV COMPLEXITYSTRINGOLOGYDE BRUIJN STRINGSCOMBINATORIAL PROPERTIES OF STRINGShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We 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.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2012-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/190842Becher, Veronica Andrea; Heiber, Pablo Ariel; A linearly computable measure of string complexity; Elsevier Science; Theoretical Computer Science; 438; 1-2012; 62-730304-3975CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2012.03.007info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0304397512002277info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:01:58Zoai:ri.conicet.gov.ar:11336/190842instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:01:58.416CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A linearly computable measure of string complexity
title A linearly computable measure of string complexity
spellingShingle A linearly computable measure of string complexity
Becher, Veronica Andrea
KOLMOGOROV COMPLEXITY
STRINGOLOGY
DE BRUIJN STRINGS
COMBINATORIAL PROPERTIES OF STRINGS
title_short A linearly computable measure of string complexity
title_full A linearly computable measure of string complexity
title_fullStr A linearly computable measure of string complexity
title_full_unstemmed A linearly computable measure of string complexity
title_sort A linearly computable measure of string complexity
dc.creator.none.fl_str_mv Becher, Veronica Andrea
Heiber, Pablo Ariel
author Becher, Veronica Andrea
author_facet Becher, Veronica Andrea
Heiber, Pablo Ariel
author_role author
author2 Heiber, Pablo Ariel
author2_role author
dc.subject.none.fl_str_mv KOLMOGOROV COMPLEXITY
STRINGOLOGY
DE BRUIJN STRINGS
COMBINATORIAL PROPERTIES OF STRINGS
topic KOLMOGOROV COMPLEXITY
STRINGOLOGY
DE BRUIJN STRINGS
COMBINATORIAL PROPERTIES OF STRINGS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description 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.
publishDate 2012
dc.date.none.fl_str_mv 2012-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/190842
Becher, Veronica Andrea; Heiber, Pablo Ariel; A linearly computable measure of string complexity; Elsevier Science; Theoretical Computer Science; 438; 1-2012; 62-73
0304-3975
CONICET Digital
CONICET
url http://hdl.handle.net/11336/190842
identifier_str_mv Becher, Veronica Andrea; Heiber, Pablo Ariel; A linearly computable measure of string complexity; Elsevier Science; Theoretical Computer Science; 438; 1-2012; 62-73
0304-3975
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2012.03.007
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0304397512002277
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269727788892160
score 13.13397

Publicaciones similares