scientific article; zbMATH DE number 1564048

MaRDI QIDQ4528868zbMATH OpenFDO

Authors Yuri Vladimirovich Merekin

Publication date 12 February 2001

zbMATH Keywords

complexitycombinatorics on wordsBoolean functionconcatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1396670
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1285633
• scientific article; zbMATH DE number 609985
• scientific article; zbMATH DE number 1432161

Cited in

(5)

• scientific article; zbMATH DE number 1855659 (Why is no real title available?)
• scientific article; zbMATH DE number 1285633 (Why is no real title available?)
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1396670 (Why is no real title available?)
• A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight

This page was built for publication:

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