Synchronizing automata with finitely many minimal synchronizing words (Q553327): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: WORDS GUARANTEEING MINIMUM IMAGE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Definite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resetting words for decidable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based testing of reactive systems. Advanced lectures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank

Latest revision as of 08:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Synchronizing automata with finitely many minimal synchronizing words
scientific article

    Statements

    Synchronizing automata with finitely many minimal synchronizing words (English)
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    synchronizing automata
    0 references
    minimal synchronizing words
    0 references
    co-NP-hard problems
    0 references

    Identifiers