On Definability of Universal Graphic Automata by Their Input Symbol Semigroups
Universal graphic automaton Atm(G, G′ ) is the universally attracting object in the category of automata, for which the set of states is equipped with the structure of a graph G and the set of output symbols is equipped with the structure of a graph G′ preserved by transition and output functions of...
| 出版年: | Известия Саратовского университета. Новая серия: Математика. Механика. Информатика |
|---|---|
| 主要な著者: | , |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
Saratov State University
2020-03-01
|
| 主題: | |
| オンライン･アクセス: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/2020/02/42-50molchanov-farakhutdinov.pdf |