×

zbMATH — the first resource for mathematics

Lower bounds on the complexity of symbolic sequences determined by symmetric Boolean functions. (Russian) Zbl 0956.68118
Schemes of the concatenation which realize binary words determined by the symmetric Boolean functions are considered. The obtained lower bounds on the complexity are asymptotically equal to the known upper bounds for almost all symmetric Boolean functions.
MSC:
68R15 Combinatorics on words
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68Q45 Formal languages and automata
PDF BibTeX XML Cite