×

zbMATH — the first resource for mathematics

Bounds on multiplicative complexity of binary words determined by zone Boolean functions. (Russian) Zbl 1009.68104
Concatenation schemes which realize binary words determined by zone Boolean functions are considered. The lower bounds obtained on the complexity are asymptotically equal to upper bounds for this class of 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