Computing the shortest reset words of synchronizing automata (Q2354297)

From MaRDI portal
Revision as of 23:58, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59407171, #quickstatements; #temporary_batch_1711574657256)
scientific article
Language Label Description Also known as
English
Computing the shortest reset words of synchronizing automata
scientific article

    Statements

    title
    Computing the shortest reset words of synchronizing automata (English)
    0 references
    author
    Jakub Kowalski
    0 references
    Marek Szykuła
    0 references
    Andrzej P. Kisielewicz
    0 references
    publication date
    10 July 2015
    0 references
    zbMATH Keywords
    synchronizing automaton
    0 references
    synchronizing word
    0 references
    Černý conjecture
    0 references
    describes a project that uses
    TESTAS
    0 references
    COMPAS
    0 references
    PATRICIA
    0 references

    Identifiers

    zbMATH DE Number
    6457760
    0 references
    OpenAlex ID
    W2045003095
    0 references
    Wikidata QID
    Q59407171
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2354297&oldid=33219481"
    Powered by MediaWiki