About superposition capabilities for automata basis containing fixed additive of Boolean functions and delay automaton

Authors introduce extended automata superposition. Extended superposition - automata superposition with fixed additive of Boolean functions and delay automaton. Authors proved algorithmic solvability of expressibility for group Medvedev automata, constant automata, linear automata