• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Quasiuniversal Boolean Automaton with Four Constant States

Moscow University Mathematics Bulletin. 2019. Vol. 74. No. 6. P. 241-245.
Translator: В. Д. Валединский.

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 the 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 fonctions, where n ≥ 3, is constructed.