On monomorphisms of hypergraphic automata

Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal hypergraphic automata. The semigroups of input symbols of such automata are derivative algebras of mappings for such automata. So their properties are interconnected with properties of the algebraic structures of the automata. This paper describes the structure of monomorphisms of such automata and their semigroups of input signals.