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