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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Saratov State University
2020-03-01
|
| Σειρά: | Известия Саратовского университета. Новая серия: Математика. Механика. Информатика |
| Θέματα: | |
| Διαθέσιμο Online: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/2020/02/42-50molchanov-farakhutdinov.pdf |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|