On concrete characterization of universal hypergraphic automata

In this paper, we consider structured automata without output signals whose state sets are endowed with an algebraic structure of hypergraphs. The main result of the paper is a theorem where we obtain necessary and sufficient conditions for the possibility to define on the state set of some automaton $A$ a structure of a hypergraph $H$ such that the automaton $A$ will be the universal hypergraphic automaton.