A linearly computable measure of string complexity

Mostrar todas las versiones(3)

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

Descripción completa

Detalles Bibliográficos
Autores principales: Becher, V., Heiber, P.A.
Formato: Artículo publishedVersion
Publicado: 2012
Materias:
Basic properties
Computable measures
De Bruijn
Description complexity
Linear time
String complexity
Sub-strings
Computer science
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v438_n_p62_Becher
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v438_n_p62_Becher_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares