Improved upper bounds on synchronizing nondeterministic automata (Q989550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4120536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / 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: Q2707235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: WORDS GUARANTEEING MINIMUM IMAGE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank

Latest revision as of 03:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds on synchronizing nondeterministic automata
scientific article

    Statements

    Improved upper bounds on synchronizing nondeterministic automata (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references