Geodesic
Quasiuniversal Boolean automaton with four constant states
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2019), pp. 51-55

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of realization of Boolean functions by initial Boolean automata with constant states and $n$ inputs is considered. Initial Boolean automaton with constant states and $n$ inputs is an initial automaton with output such that in all states output functions are $n$-ary constant Boolean functions $0$ or $1$. An example of an initial Boolean automaton with the minimum number of constant states and $n$ inputs realizing the maximum possible number of $n$-ary Boolean functions, where $n \geq 3$, is constructed. 
@article{VMUMM_2019_6_a7,
     author = {L. N. Sysoeva},
     title = {Quasiuniversal {Boolean} automaton with four constant states},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {51--55},
     publisher = {mathdoc},
     number = {6},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2019_6_a7/}
}
TY  - JOUR
AU  - L. N. Sysoeva
TI  - Quasiuniversal Boolean automaton with four constant states
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2019
SP  - 51
EP  - 55
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2019_6_a7/
LA  - ru
ID  - VMUMM_2019_6_a7
ER  - 
%0 Journal Article
%A L. N. Sysoeva
%T Quasiuniversal Boolean automaton with four constant states
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2019
%P 51-55
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2019_6_a7/
%G ru
%F VMUMM_2019_6_a7
L. N. Sysoeva. Quasiuniversal Boolean automaton with four constant states. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2019), pp. 51-55. http://geodesic.mathdoc.fr/item/VMUMM_2019_6_a7/