Polynomially ambiguous probabilistic automata on restricted languages (Q2121470)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomially ambiguous probabilistic automata on restricted languages
scientific article

    Statements

    Polynomially ambiguous probabilistic automata on restricted languages (English)
    0 references
    0 references
    4 April 2022
    0 references
    0 references
    probabilistic finite automata
    0 references
    ambiguity
    0 references
    undecidability
    0 references
    bounded language
    0 references
    formal language theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references