On Models of a Nondeterministic Computation

Authors:
Mikhail N. Vyalyi
Affiliations:
Dorodnitsyn Computing Center of RAS, Moscow, Russia 119991
Venue:
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Year:
2009

Citing 10
Cited 2

On the power of synchronization in parallel computations

Discrete Applied Mathematics - Formal language theory
Algorithmic number theory

Algorithmic number theory
A communication hierarchy of parallel computations

Theoretical Computer Science
Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Alternating and empty alternating auxiliary stack automata

Theoretical Computer Science
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

Orbits of linear maps and regular languages

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On regular realizability problems

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 models of nondeterministic computation. These characterizations differ from the well-known ones by absence of alternation.