A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417)

From MaRDI portal
Revision as of 17:42, 28 June 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
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
scientific article

    Statements

    title
    A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (English)
    0 references
    DOI
    10.1051/ita:2008017
    0 references
    author
    Daniel Kirsten
    0 references
    publication date
    25 September 2008
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q70
    0 references
    20M35
    0 references
    zbMATH DE Number
    5346817
    0 references
    OpenAlex ID
    W2000587532
    0 references
    cites work
    Q4449534
    0 references
    Q3994777
    0 references
    Q2754144
    0 references
    Q3742754
    0 references
    Q2766855
    0 references
    Q3431481
    0 references
    Q3704880
    0 references
    Q4395215
    0 references
    Q4155837
    0 references
    Q3804221
    0 references
    Q4273675
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3526417&oldid=35073949"
    Powered by MediaWiki