|
|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2017, Number 2, Pages 19–28
(Mi vmumm53)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
L. N. Sysoeva Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
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$. The exact value of the maximum number of $n$-ary Boolean functions, where $n > 1$, realized by an initial Boolean automaton with three constant states and $n$ inputs is obtained.
Key words:
Boolean function, initial automaton, realization of Boolean functions.
Received: 03.06.2016
Citation:
L. N. Sysoeva, “Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 2, 19–28; Moscow University Mathematics Bulletin, 72:2 (2017), 61–69
Linking options:
https://www.mathnet.ru/eng/vmumm53 https://www.mathnet.ru/eng/vmumm/y2017/i2/p19
|
|