On problem of concrete characterization of universal automata


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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


版权所有 © Pleiades Publishing, Ltd., 2017
##common.cookie##