Abstract
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 of defining 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have