Decidable Problems for Probabilistic Automata on Infinite Words (Q2986795)

From MaRDI portal
Revision as of 10:38, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decidable Problems for Probabilistic Automata on Infinite Words
scientific article

    Statements

    title
    Decidable Problems for Probabilistic Automata on Infinite Words (English)
    0 references
    author
    Krishnendu Chatterjee
    0 references
    Mathieu Tracol
    0 references
    publication date
    16 May 2017
    0 references
    zbMATH Keywords
    automata
    0 references
    formal languages
    0 references
    probabilistic automata
    0 references
    parity conditions
    0 references
    decision problems
    0 references

    Identifiers

    DOI
    10.1109/LICS.2012.29
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q17
    0 references
    68Q87
    0 references
    zbMATH DE Number
    6718078
    0 references
    arXiv ID
    1107.2091
    0 references
    OpenAlex ID
    W2079852549
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2986795&oldid=37316114"
    Powered by MediaWiki