Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134)
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 problems concerning reset words for cyclic and Eulerian automata |
scientific article; zbMATH DE number 6064523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of problems concerning reset words for cyclic and Eulerian automata |
scientific article; zbMATH DE number 6064523 |
Statements
Complexity of problems concerning reset words for cyclic and Eulerian automata (English)
0 references
9 August 2012
0 references
synchronization
0 references
automata
0 references
reset words
0 references
computational complexity
0 references
0.999046504497528
0 references
0.9261905550956726
0 references
0.9237976670265198
0 references
0.8925848007202148
0 references
0.8905193209648132
0 references
