Binary sequences. III: Complexity versus homogeneity and symmetry

DOI10.1016/0020-0255(83)90021-XMaRDI QIDQ794435zbMATH OpenOpenAlexFDO

Authors Frank Papentin, Michael Krüger

Publication date 1983

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(83)90021-x

zbMATH Keywords

binary sequencescomplexityhomogeneitymeasuressymmetry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of computing (68Q99)

Recommendations

• Binary sequences. II: Homogeneity and symmetry
• Binary sequences. I: Complexity
• scientific article; zbMATH DE number 1740058
• On the complexity of finite sequences over a finite set
• Measuring static complexity

Cites work

• Binary sequences. I: Complexity

Cited in

(8)

• The measures of sequence complexity for EEG studies
• Inhomogeneity and complexity measures for spatial patterns
• scientific article; zbMATH DE number 2100607 (Why is no real title available?)
• Regularity versus complexity in the binary representation of 3ⁿ
• Measuring complexity through average symmetry
• On the fragmentary complexity of symbolic sequences
• Binary sequences. I: Complexity
• Binary sequences. II: Homogeneity and symmetry

This page was built for publication: Binary sequences. III: Complexity versus homogeneity and symmetry

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