Linearly realizable automata
Sergey Borisovich Rodin · Discrete Mathematics and Applications · 2017
Abstract The paper is devoted to the investigation of “linearly realizable” automata, i.e. automata that allow state encodings that lead to implementations with linear Boolean operators. We formulate the criterion of linear realizability and obtain upper and lower bounds on the number of linearly realizable automata.