scientific article; zbMATH DE number 1396670

MaRDI QIDQ4936628zbMATH OpenFDO

Authors Yuri Vladimirovich Merekin

Publication date 31 January 2000

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 1564048
• scientific article; zbMATH DE number 1855659
• scientific article; zbMATH DE number 1432161
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1285633

Cited in

(6)

• On the multiplicative complexity of binary words with a given number of units.
• scientific article; zbMATH DE number 1285633 (Why is no real title available?)
• scientific article; zbMATH DE number 1564048 (Why is no real title available?)
• Tight bounds for the multiplicative complexity of symmetric functions
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1855659 (Why is no real title available?)

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 Q4936628)