Elementary definability of the class of universal hypergraphic automata in the class of semigroups
Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal hypergraphic automata. The semigrou...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Saratov State University
2022-08-01
|
| Series: | Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика |
| Subjects: | |
| Online Access: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/text-pdf/2022/08/293-306-molchanov-khvorostukhina_0.pdf |