Complexity of a problem concerning reset words for Eulerian binary automata (Q515691)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6695657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of a problem concerning reset words for Eulerian binary automata |
scientific article; zbMATH DE number 6695657 |
Statements
Complexity of a problem concerning reset words for Eulerian binary automata (English)
0 references
16 March 2017
0 references
0.9979021549224854
0 references
0.9247603416442872
0 references
0.9237976670265198
0 references
0.8661069869995117
0 references
0.8373926877975464
0 references
