Parallel time o(log n) acceptance of deterministic CFLs
Conference
·
OSTI ID:5179434
The author gives a parallel RAM algorithm for simulating a deterministic auxiliary pushdown machine. If the push-down machine uses space s(n) > log n and time 2/sup o(s(n))/ then this parallel simulation algorithm takes time o(s(n)) and requires 2/sup o(s(n))/ processors. Thus any deterministic context free language is accepted in time o(log n) by the parallel RAM algorithm using a polynomial number of processors. This algorithm can easily be extended to also accept the lr(k) languages in time o(log n) and 2/sup o(k)/ processors. The simulation algorithm is near optimal for parallel RAMs; since it is shown that the language accepted in time t(n) by a parallel RAM is accepted by a deterministic auxiliary pushdown machine. 19 references.
- OSTI ID:
- 5179434
- Report Number(s):
- CONF-821180-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel time O(log n) acceptance of deterministic cfls on an exclusive-write P-RAM
Deterministic simulation of idealized parallel computers on more realistic ones
Instruction sets for Parallel Random Access Machines
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6987765
Deterministic simulation of idealized parallel computers on more realistic ones
Journal Article
·
Thu Oct 01 00:00:00 EDT 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:5793238
Instruction sets for Parallel Random Access Machines
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:7129054