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
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129047924, #quickstatements; #temporary_batch_1723853789000
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2898531758 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.00651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation theory of finite semigroups, semigroup radicals and formal language theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semisimple Synchronizing Automata and the Wedderburn-Artin Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Mortality and the Černý-Pin Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing generalized monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive digraphs with large exponents and slowly synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing groups and automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic synchronization criterion and computing reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset words for commutative and solvable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive and irreducible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Černý conjecture for one-cluster automata with prime length cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129047924 / rank
 
Normal rank

Latest revision as of 01:26, 17 August 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
    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