Computing the shortest reset words of synchronizing automata (Q2354297)

From MaRDI portal
Revision as of 12:46, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 DE Number
    6457760
    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
    OpenAlex ID
    W2045003095
    0 references
    Wikidata QID
    Q59407171
    0 references
    cites work
    Q4452055
    0 references
    Q5509690
    0 references
    Synchronization
    0 references
    Q5422239
    0 references
    Q4418619
    0 references
    Q5306174
    0 references
    Q4324960
    0 references
    Q4945338
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2354297&oldid=36190738"
    Powered by MediaWiki