Binary sequences. III: Complexity versus homogeneity and symmetry

DOI10.1016/0020-0255(83)90021-XzbMATH Open0541.68028OpenAlexW2092204067MaRDI QIDQ794435FDOQ794435

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

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

zbMATH Keywords

measuressymmetrycomplexityhomogeneitybinary sequences

Mathematics Subject Classification ID

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

Cites Work

• Binary sequences. I: Complexity

Cited In (7)

• Inhomogeneity and complexity measures for spatial patterns
• Binary sequences. I: Complexity
• Measuring complexity through average symmetry
• Title not available (Why is that?)
• Regularity versus complexity in the binary representation of 3^n
• Binary sequences. II: Homogeneity and symmetry
• The measures of sequence complexity for EEG studies

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)