Binary sequences. I: Complexity
DOI10.1016/0020-0255(83)90019-1zbMATH Open0541.68026OpenAlexW2081208267MaRDI QIDQ794433FDOQ794433
Authors: Frank Papentin 
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)90019-1
Recommendations
- On minimal-program complexity measures
- scientific article; zbMATH DE number 3890728
- Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
- Chaitin complexity, Shannon information content of a single event and infinite random sequences. I
- scientific article; zbMATH DE number 4211347
complexityinformation theorybinary sequencesrandom sequencesformal language theoryhierarchy of description languages
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Theory of computing (68Q99)
Cites Work
Cited In (15)
- Are binary codings universal?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relative complexity of random walks in random sceneries
- Title not available (Why is that?)
- Descriptive complexity of computable sequences
- Constraints placed on random sequences by their compressibility
- Symbolic codes for multifrequency binary testing of control systems
- Measuring static complexity
- On minimal-program complexity measures
- Binary sequences. II: Homogeneity and symmetry
- Binary sequences. III: Complexity versus homogeneity and symmetry
- Sequences of binary strings with relation of conditional simplicity
- Title not available (Why is that?)
- Physical complexity of symbolic sequences
This page was built for publication: Binary sequences. I: Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794433)
