Binary sequences. I: Complexity

DOI10.1016/0020-0255(83)90019-1zbMath0541.68026OpenAlexW2081208267MaRDI QIDQ794433

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

zbMATH Keywords

complexitybinary sequencesinformation theoryrandom sequencesformal language theoryhierarchy of description languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Information theory (general) (94A15) Theory of computing (68Q99)

Related Items (3)

Binary sequences. II: Homogeneity and symmetry ⋮ Binary sequences. III: Complexity versus homogeneity and symmetry ⋮ Symbolic codes for multifrequency binary testing of control systems

Cites Work

• Unnamed Item
• Unnamed Item
• Binary sequences. III: Complexity versus homogeneity and symmetry
• Information-theoretic computation complexity

This page was built for publication: Binary sequences. I: Complexity