Complexity of a problem concerning reset words for Eulerian binary automata (Q5404945)
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: Complexity of a problem concerning reset words for Eulerian binary automata |
scientific article; zbMATH DE number 6275892
| 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 6275892 |
Statements
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (English)
0 references
31 March 2014
0 references
0.9979021549224854
0 references
0.9264903664588928
0 references
0.9261905550956726
0 references
0.8660047650337219
0 references
0.8393042683601379
0 references
