ON EPIMORPHISMS OF HYPERGRAPHIC AUTOMATA AND INPUT SYMBOL SEMIGROUPS
DOI:
https://doi.org/10.46991/PYSUA.2026.60.3.123Keywords:
hypergraphic automaton, epimorphism, semigroup, effective hypergraph, $p$-definable edges, $p$-hypergraph, projective plane, lifting propertyAbstract
Hypergraphic automata are automata, whose state sets and output symbol sets are hypergraphs invariant under the actions of the transition and output functions. Universally attracting objects in the category of such automata are called universal hypergraphic automata; their semigroups of input symbols are algebras of mappings whose properties are tightly linked to the algebraic structure of the automata themselves. In this paper we describe surjective morphisms (epimorphisms) of universal hypergraphic automata and of their semigroups of input symbols, for effective hypergraphs with $p$-definable edges. Under two mild hypotheses, a triple $(f,\mathbb P_s,g)$ is an epimorphism if and only if the state component $f$ is an isomorphism and the output component $g$ is a homomorphism satisfying a lifting condition. We introduce weak and strong epimorphisms of hypergraphs, show that they differ, and prove that liftability yields strong surjectivity under a size condition on edges. For automata whose state hypergraphs are projective or affine planes, the state components of epimorphisms are exactly the collineations.
Downloads
References
Plotkin B.I., Greenglaz L.Ja., Gvaramija A.A. Algebraic Structures in Automata and Databases Theory. Singapore, World Scientific (1992).
Hartshorne R. Foundations of Projective Geometry. New York, Ishi Press (2009) (reprint of the 1967 edition).
K'arteszi F. Introduction to Finite Geometries. Amsterdam, North-Holland (1976).
Bretto A. Hypergraph Theory: An Introduction. Springer, Cham (2013).
Zykov A.A. Hypergraphs. Uspekhi Mat. Nauk 29 (1974), 89-154.
Eilenberg S. Automata, Languages, and Machines. V. A. New York, Academic Press (1974).
Lallement G. Semigroups and Combinatorial Applications. New York, Wiley (1979).
Vagner V.V. The Theory of Semigroups and Their Applications. V. 1. Saratov, Saratov University (1965).
Molchanov V.A., Khvorostukhina E.V. On Problem of Abstract Definability of Universal Hypergraphic Automata by Input Symbol Semigroup. Chebyshevskii Sb. 20 (2019), 251-264. https://doi.org/10.18500/1816-9791-2022-22-3-293-306
Khvorostukhina E.V., Molchanov V.A. On Problem of Concrete Characterization of Universal Automata. Lobachevskii J. Math. 38 (2017), 664-669. https://doi.org/10.1134/S1995080217040114
Khvorostukhina E.V. On Monomorphisms of Universal Hypergraphic Automata. Lobachevskii J. Math. 46 (2025), 6143-6149. https://doi.org/10.1134/S1995080225614109
Yang C.-C. Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism. IEEE Trans. Comput. C-24 (1975), 1133-1139. https://doi.org/10.1109/t-c.1975.224148
Bavel Z. Structure and Transition-Preserving Functions of Finite Automata. J. ACM 15 (1968), 135-158. https://doi.org/10.1145/321439.321448
Zhang C., et al. Homotopy and Hom Construction in the Category of Finite Hypergraphs. Graphs Combin. 39 (2023). https://doi.org/10.1007/s00373-023-02672-6
Almeida J., Shah A.H. Epimorphisms and Pseudovarieties of Semigroups. Semigroup Forum (2025). https://doi.org/10.1007/s00233-025-10600-8
Lam C.S. Some Characterizations of the Hereditary Pretorsion Class of Semigroup Automata. Glasgow Math. J. 35 (1993), 327-337. https://doi.org/10.1017/s0017089500009903
Cain A.J. Automaton Semigroups. Theoret. Comput. Sci. 410 (2009), 5022-5038. https://doi.org/10.1016/j.tcs.2009.07.054
D'Angeli D., RodaroE., W"achter J.P. On the Structure Theory of Partial Automaton Semigroups. Semigroup Forum 101 (2020), 51-76. https://doi.org/10.1007/s00233-020-10114-5
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Proceedings of the YSU

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.