Chebyshevskii Sbornik
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Chebyshevskii Sb.: Year: Volume: Issue: Page: Find

 Chebyshevskii Sb., 2019, Volume 20, Issue 2, Pages 259–272 (Mi cheb768)

On problem of abstract definability of universal hypergraphic automata by input symbol semigroup

V. A. Molchanova, E. V. Khvorostukhinab

a Saratov national research state University named after N. G. Chernyshevsky (Saratov)
b Yuri Gagarin State Technical University of Saratov (Saratov)

Abstract: 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 such automata are called universal hypergraphic automata. The semigroups of input symbols of such automata are derivative algebras of mappings for such automata. Semigroup properties are interconnected with properties of the automaton. Therefore, we can study universal hypergraphic automata by investigation of their input symbol semigroups. In this paper, we solve a problem of abstract definability of such automata by their input symbol semigroups. This problem is to find the conditions of isomorphism of semigroups of input symbols of universal hypergraphic automata. The main result of the paper is the solving of this problem for universal hypergraphic automata over effective hypergraphs with $p$-definable edges. It is a wide and a very important class of automata because such algebraic systems contain automata whose state hypergraphs and output symbol hypergraphs are projective or affine planes. Also they include automata whose state hypergraphs and output symbol hypergraphs are divided into equivalence classes without singleton classes. In the current study, we proved that such automata were determined up to isomorphism by their input symbol semigroups and we described the structure of isomorphisms of such automata.

Keywords: problem of abstract definability, automaton, hypergraph, semigroup.

DOI: https://doi.org/10.22405/2226-8383-2018-20-2-259-272

Full text: PDF file (632 kB)
References: PDF file   HTML file

UDC: 512, 519.7
Accepted:12.07.2019

Citation: V. A. Molchanov, E. V. Khvorostukhina, “On problem of abstract definability of universal hypergraphic automata by input symbol semigroup”, Chebyshevskii Sb., 20:2 (2019), 259–272

Citation in format AMSBIB
\Bibitem{MolKhv19} \by V.~A.~Molchanov, E.~V.~Khvorostukhina \paper On problem of abstract definability of universal hypergraphic automata by input symbol semigroup \jour Chebyshevskii Sb. \yr 2019 \vol 20 \issue 2 \pages 259--272 \mathnet{http://mi.mathnet.ru/cheb768} \crossref{https://doi.org/10.22405/2226-8383-2018-20-2-259-272} 

• http://mi.mathnet.ru/eng/cheb768
• http://mi.mathnet.ru/eng/cheb/v20/i2/p259

 SHARE:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles

This publication is cited in the following articles:
1. A. V. Litavrin, “Endomorfizmy konechnykh kommutativnykh gruppoidov, svyazannykh s mnogosloinymi neironnymi setyami pryamogo raspredeleniya”, Tr. IMM UrO RAN, 27, no. 1, 2021, 130–145
•  Number of views: This page: 79 Full text: 20 References: 2