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$. 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.
Key words:Boolean function, initial automaton, realization of Boolean functions.
Fulltext:
PDF file (2037 kB)