Infinite vs. finite size-bounded randomized computations (Q2637645)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Infinite vs. finite size-bounded randomized computations
scientific article

    Statements

    Infinite vs. finite size-bounded randomized computations (English)
    0 references
    0 references
    13 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic computations
    0 references
    Las Vegas randomization
    0 references
    time complexity
    0 references
    size complexity
    0 references
    rotating finite automata
    0 references
    sweeping finite automata
    0 references
    0 references