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...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Saratov State University
2020-03-01
|
| Series: | Известия Саратовского университета. Новая серия: Математика. Механика. Информатика |
| Assuntos: | |
| Acceso en liña: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/2020/02/42-50molchanov-farakhutdinov.pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|