Lower bounds for the length of reset words in Eulerian automata (Q2841998)
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: Lower bounds for the length of reset words in Eulerian automata |
scientific article; zbMATH DE number 6192843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the length of reset words in Eulerian automata |
scientific article; zbMATH DE number 6192843 |
Statements
30 July 2013
0 references
synchronizing automaton
0 references
Černy conjecture
0 references
digraphs
0 references
exponent of a digraph
0 references
reset words
0 references
Lower bounds for the length of reset words in Eulerian automata (English)
0 references
0.9962824583053588
0 references
0.933416783809662
0 references
0.8638364672660828
0 references
0.832318127155304
0 references
0.8305369019508362
0 references
