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