A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387)

From MaRDI portal
Revision as of 23:53, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
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
    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

    Identifiers