Issue No. 05 - May (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24282
Nondeterministic analogues of the well-known language classes NC and SC called NNC and NSC, respectively, are investigated. NC is the class of languages that can be accepted by small, fast parallel computers; SC is the class of languages that can be recognized by a deterministic Turing machine in polynomial time and polylog tape-head reversals. Adding nondeterminism to SC leaves it in the domai
nondeterministic analogues; nondeterminism; fast parallel computers; language classes; NC; SC; NNC; NSC; deterministic Turing machine; polylog tape-head reversals; parallel computation; POLYLOGSPACE; subset; simultaneous polynomial time; read-only input tape; read-write work tape; computational complexity; formal languages; parallel machines; Turing machines.
I. Parberry, "A Note on Nondeterminism in Small, Fast Parallel Computers," in IEEE Transactions on Computers, vol. 38, no. , pp. 766-767, 1989.