On Models of a Nondeterministic Computation

@inproceedings{Vyalyi2009OnMO,
  title={On Models of a Nondeterministic Computation},
  author={M. Vyalyi},
  booktitle={CSR},
  year={2009}
}
  • M. Vyalyi
  • Published in CSR 2009
  • Mathematics, Computer Science
  • In this paper we consider a nondeterministic computation performed by deterministic multi-head 2-way automata with a read-only access to an auxiliary memory. The memory contains additional data (a guess) and the computation is successful iff it is successful for some memory content. Also we consider the case of restricted guesses in which a guess should satisfy some constraint. We show that the standard complexity classes such as L, NL, P, NP, PSPACE can be characterized in terms of these… CONTINUE READING
    5 Citations
    Regular realizability problems and models of a generalized nondeterminism
    • 3
    • PDF
    On regular realizability problems
    • M. Vyalyi
    • Mathematics, Computer Science
    • Probl. Inf. Transm.
    • 2011
    • 10
    Orbits of Linear Maps and Regular Languages
    • 10
    • PDF
    Universality of Regular Realizability Problems
    • M. Vyalyi
    • Mathematics, Computer Science
    • CSR
    • 2013
    • 1

    References

    SHOWING 1-10 OF 33 REFERENCES
    Undecidability on quantum finite automata
    • 62
    A Communication Hierarchy of Parallel Computations
    • 6
    Alternating and empty alternating auxiliary stack automata
    • 7
    • PDF
    Introduction to Automata Theory, Languages and Computation
    • 13,701
    • PDF
    Formal Language Characterizations of P, NP, and PSPACE
    • B. Borchert
    • Mathematics, Computer Science
    • J. Autom. Lang. Comb.
    • 2008
    • 7
    On the power of synchronization in parallel computations
    • 38
    Finite Model Theory and Its Applications
    • 177
    • PDF
    Tree-Walking Automata
    • 34
    • PDF