Multihead two-way probabilistic finite automata (Q675857): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a fair roulette from a possibly biased coin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of probabilistic versus deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New problems complete for nondeterministic log space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing the bandwidth of a transition matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformational methods and their application to complexity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded hierarchies and probabilistic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Turing Machines and Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability by Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating refined space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for separating space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded complexity classes and multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank
 
Normal rank

Latest revision as of 10:44, 27 May 2024

scientific article
Language Label Description Also known as
English
Multihead two-way probabilistic finite automata
scientific article

    Statements

    Multihead two-way probabilistic finite automata (English)
    0 references
    0 references
    11 March 1997
    0 references
    multihead probabilistic finite automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers