A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387)
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: A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number |
scientific article |
Statements
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (English)
0 references
6 December 2019
0 references
synchronizing automaton
0 references
Černý's conjecture
0 references
packing number
0 references
simple automaton
0 references
semisimple automaton
0 references
Wedderburn-Artin theorem
0 references
0 references
0.8213834166526794
0 references
0.8108294010162354
0 references
0.8047012686729431
0 references
