Synchronizing finite automata with short reset words (Q1008633): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4452055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422239 / 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: Rank of a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418619 / rank
 
Normal rank

Revision as of 04:35, 29 June 2024

scientific article
Language Label Description Also known as
English
Synchronizing finite automata with short reset words
scientific article

    Statements

    Synchronizing finite automata with short reset words (English)
    0 references
    0 references
    30 March 2009
    0 references
    synchronizing words
    0 references
    reset sequences
    0 references
    Černý conjecture
    0 references
    synchronizing algorithms
    0 references

    Identifiers