Symbolic analysis of finite words: the complexity function

DOI10.1007/S00574-003-0024-1MaRDI QIDQ1880242zbMATH OpenOpenAlexFDO

Authors Sébastien Jaeger, Brigitte Mossé, Ricardo Lima

Publication date 22 September 2004

Published in Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00574-003-0024-1

zbMATH Keywords

complexitysymbolic analysisfinite words

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Combinatorics on words (68R15) General biology and biomathematics (92B05)

Recommendations

• Properties of the complexity function for finite words
• Three complexity functions
• A new complexity function for words based on periodicity
• scientific article; zbMATH DE number 1992418
• scientific article; zbMATH DE number 1091206

Cited in

(12)

• A toolkit for graphical analysis of word chains
• scientific article; zbMATH DE number 13329 (Why is no real title available?)
• Restriction of search space in systems of symbol processing
• Arithmetical complexity of symmetric D0L words.
• The complexity of Fibonacci-like kneading sequences
• The complexity of computing maximal word functions
• scientific article; zbMATH DE number 1992418 (Why is no real title available?)
• Properties of the complexity function for finite words
• The complexity of tangent words
• Three complexity functions
• Robustness of the decomposition functional for a sequence of symbols in a given dictionary of standard fragments
• Comparative study of finite wordlength effects in shift and delta operator parameterizations

This page was built for publication: Symbolic analysis of finite words: the complexity function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880242)