On problem of concrete characterization of universal automata
- 作者: Khvorostukhina E.1, Molchanov V.2
-
隶属关系:
- Yuri Gagarin State Technical University of Saratov
- Saratov State University
- 期: 卷 38, 编号 4 (2017)
- 页面: 664-669
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/199613
- DOI: https://doi.org/10.1134/S1995080217040114
- ID: 199613
如何引用文章
详细
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.
作者简介
E. Khvorostukhina
Yuri Gagarin State Technical University of Saratov
编辑信件的主要联系方式.
Email: katyanew2007@rambler.ru
俄罗斯联邦, ul. Politekhnicheskaya 77, Saratov
V. Molchanov
Saratov State University
Email: katyanew2007@rambler.ru
俄罗斯联邦, ul. Astrakhanskaya 83, Saratov