Fast recognition of deterministic cfl's with a smaller number of processors
From MaRDI portal
(Redirected from Publication:685360)
Recommendations
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
- scientific article; zbMATH DE number 3960999
- On the parallel recognition of unambiguous context-free languages
- scientific article; zbMATH DE number 3978426
- Parallel RAMs with owned global memory and deterministic context-free language recognition
Cites work
- scientific article; zbMATH DE number 4205991 (Why is no real title available?)
- scientific article; zbMATH DE number 3978426 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 52889 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- On the parallel recognition of unambiguous context-free languages
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
- Parallelism in random access machines
- The recognition of deterministic CFLs in small time and space
Cited in
(8)- Fast parallel recognition of LR language suffixes
- Advocating ownership
- Parallel recognition and ranking of context-free languages
- The recognition of deterministic CFLs in small time and space
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
- Parallel RAMs with owned global memory and deterministic context-free language recognition
- scientific article; zbMATH DE number 3960999 (Why is no real title available?)
This page was built for publication: Fast recognition of deterministic cfl's with a smaller number of processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685360)
