Hypergraphic automata are automata whose state sets and sets of output symbols are endowed with algebraic structures of hypergraphs preserving by transition and exit functions. Universally attracting objects in the category of hypergraphic automata are automata Atm (H1,H2), where H1 is a hypergraph of the state set, H2 is a hypergraph of the set of output symbols and S = EndH1 × Hom(H1,H2) is a semigroup of input symbols. Such automata are called universal hypergraphic automata.
