Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 12-17
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 two constant states and $n$ inputs is considered.
Initial Boolean automaton with two 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$.
The maximum cardinality of set of $n$-ary Boolean functions where $n > 1$ realized by an initial Boolean automaton with two constant states and $n$ inputs is obtained.
@article{VMUMM_2016_4_a1,
author = {L. N. Sysoeva},
title = {Maximal number of {Boolean} functions realized by an initial {Boolean} automaton with two constant states},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {12--17},
publisher = {mathdoc},
number = {4},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a1/}
}
TY - JOUR AU - L. N. Sysoeva TI - Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2016 SP - 12 EP - 17 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a1/ LA - ru ID - VMUMM_2016_4_a1 ER -
%0 Journal Article %A L. N. Sysoeva %T Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states %J Vestnik Moskovskogo universiteta. Matematika, mehanika %D 2016 %P 12-17 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a1/ %G ru %F VMUMM_2016_4_a1
L. N. Sysoeva. Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 12-17. http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a1/