A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1711.00651 / rank | |||
Normal rank | |||
Revision as of 00:53, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
