×

zbMATH — the first resource for mathematics

On the complexity of symbolic sequences determined by linear Boolean functions. (Russian) Zbl 0936.68080
Schemata of the concatenation which realize binary words determined by the linear Boolean functions are considered. A linear upper bound on the complexity of these words for the schemata of the concatenation is obtained. The exact value of the complexity for some special sequences of binary words is also obtained.
MSC:
68R15 Combinatorics on words
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68Q45 Formal languages and automata
PDF BibTeX XML Cite