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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2009.05.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014108239 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2009.05.007 / rank
 
Normal rank

Latest revision as of 11:39, 10 December 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
    algorithms
    0 references
    combinatorial problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers