Completeness Conditions of Systems of Moore Automata
A. A. Donis · Information Technologies and Control · 2013
Abstract This paper describes sufficient completeness conditions for the class of Moore automata, compositions with feedback on this class and the behavior realization. It is shown how to realize a delay by automata from the set satisfying sufficient conditions for completeness. The ideas of these constructions demonstrate how from a set of automata with long cycles of transients can be realized a delay with short cycle of transient. It is shown that there are large finite complete sets of automata, for which any proper subsets are not complete.