This article is cited in 1 paper

On relationship between linear realized automata and automata with maximal variability with respect to state encoding

S. B. Rodin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: This article is devoted to studying the connection between“simple” realized automata and automata which have property that Boolean operators inspired by different state encodings are different. It was proven that these automata classes have non empty intersection and each class doesn't contain another entirely.

Keywords: transitional system, coding, complexity.