Email this article On problem of concrete characterization of universal automata
- Authors: Khvorostukhina E.V.1, Molchanov V.A.2
-
Affiliations:
- Yuri Gagarin State Technical University of Saratov
- Saratov State University
- Issue: Vol 38, No 4 (2017)
- Pages: 664-669
- Section: Article
- URL: https://journal-vniispk.ru/1995-0802/article/view/199613
- DOI: https://doi.org/10.1134/S1995080217040114
- ID: 199613
Cite item
Open Access
Access granted
Subscription Access
Abstract
In the paper we investigate automata whose state sets and sets of output symbols are endowed with algebraic structures of hypergraphs. Universal hypergraphic automata are universally attracting objects in the category of such automata. The main result is a solving of the problem of concrete characterization of universal hypergraphic automata.
Keywords
About the authors
E. V. Khvorostukhina
Yuri Gagarin State Technical University of Saratov
Author for correspondence.
Email: katyanew2007@rambler.ru
Russian Federation, ul. Politekhnicheskaya 77, Saratov
V. A. Molchanov
Saratov State University
Email: katyanew2007@rambler.ru
Russian Federation, ul. Astrakhanskaya 83, Saratov
Supplementary files
