On problem of abstract definability of universal hypergraphic automata by input symbol semigroup (Q5110064)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On problem of abstract definability of universal hypergraphic automata by input symbol semigroup |
scientific article; zbMATH DE number 7201064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On problem of abstract definability of universal hypergraphic automata by input symbol semigroup |
scientific article; zbMATH DE number 7201064 |
Statements
15 May 2020
0 references
problem of abstract definability
0 references
automaton
0 references
hypergraph
0 references
semigroup
0 references
0.9418674111366272
0 references
0.9180843234062196
0 references
0.904876947402954
0 references
0.8576799631118774
0 references
0.851905345916748
0 references
