LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (Q2841998): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vladimir V. Gusev / rank
Normal rank
 
Property / author
 
Property / author: Vladimir V. Gusev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponents of tuples of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponents of nonnegative matrix pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponents of 2-regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unzerlegbare, nicht negative Matrizen / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:18, 6 July 2024

scientific article
Language Label Description Also known as
English
LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA
scientific article

    Statements

    LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (English)
    0 references
    30 July 2013
    0 references
    0 references
    synchronizing automaton
    0 references
    Černy conjecture
    0 references
    digraphs
    0 references
    exponent of a digraph
    0 references
    reset words
    0 references
    0 references