|
|
Intelligent systems. Theory and applications, 2015, Volume 19, Issue 3, Pages 71–78
(Mi ista195)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Part 3. Mathematical models
About superposition capabilities for automata basis containing fixed additive of Boolean functions and delay automaton
D. N. Babin, A. A. Letunovskii
Abstract:
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
Keywords:
Automaton, superposition, algorithm.
Citation:
D. N. Babin, A. A. Letunovskii, “About superposition capabilities for automata basis containing fixed additive of Boolean functions and delay automaton”, Intelligent systems. Theory and applications, 19:3 (2015), 71–78
Linking options:
https://www.mathnet.ru/eng/ista195 https://www.mathnet.ru/eng/ista/v19/i3/p71
|
|