On problem of concrete characterization of universal automata
- Autores: Khvorostukhina E.1, Molchanov V.2
-
Afiliações:
- Yuri Gagarin State Technical University of Saratov
- Saratov State University
- Edição: Volume 38, Nº 4 (2017)
- Páginas: 664-669
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/199613
- DOI: https://doi.org/10.1134/S1995080217040114
- ID: 199613
Citar
Resumo
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.
Palavras-chave
Sobre autores
E. Khvorostukhina
Yuri Gagarin State Technical University of Saratov
Autor responsável pela correspondência
Email: katyanew2007@rambler.ru
Rússia, ul. Politekhnicheskaya 77, Saratov
V. Molchanov
Saratov State University
Email: katyanew2007@rambler.ru
Rússia, ul. Astrakhanskaya 83, Saratov