Sequences of binary strings with relation of conditional simplicity

zbMATH Open0990.94021MaRDI QIDQ5960250

A. Romashchenko

Publication date: 14 April 2002

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

analogue of Turing degrees of unsolvabilitysequence of binary strings

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Information theory (general) (94A15) Semilattices (06A12)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Binary sequences. I: Complexity 👍 👎
• A note on ternary sequences of strings of 0 and 1 👍 👎
• A complexity measure for families of binary sequences 👍 👎
• De Bruijn Sequences for Fixed-Weight Binary Strings 👍 👎
• On a Class of Binary Sequences 👍 👎
• On the Compatibility of Binary Sequences 👍 👎

This page was built for publication: Sequences of binary strings with relation of conditional simplicity

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