The Structure of Isomorphisms of Universal Hypergraphical Automata
Universal hypergraphical automata are universally attracting objects in the category of automata for which the set of states and the set of output symbols are equipped with structures of hypergraphs. It was proved earlier that a wide class of such sort of automata are determined up to isomorphism by their semigroups of input symbols. We investigate the connection between isomorphisms of universal hypergraphical automata and isomorphisms of their components: semigroups of input symbols and hypergraphs of states and output symbols.
Unable to display preview. Download preview PDF.
- 2.A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Vol. I, Amer. Math. Soc., Providence, Rhode Island (1964).Google Scholar
- 6.V. A. Molchanov, “Representation of universal planar automata by autonomous input signals,” Izv. Saratov. Univ., Ser. Mat. Mekh. Inform., 13, No. 2, Pt. 2, 31–37 (2013).Google Scholar
- 9.B. I. Plotkin, L. Ja. Greenglaz, and A. A. Gvaramija, Algebraic Structures in Automata and Databases Theory, River Edge, Singapore; World Scientific, New York (1992).Google Scholar