Fast recognition of deterministic cfl's with a smaller number of processors
From MaRDI portal
Publication:685360
DOI10.1016/0304-3975(93)90333-OzbMATH Open0783.68067MaRDI QIDQ685360FDOQ685360
Authors: Burkhard Monien, Wojciech Rytter, Leopold Schäpers 
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelism in random access machines
- On the parallel recognition of unambiguous context-free languages
- The recognition of deterministic CFLs in small time and space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
Cited In (8)
- Fast parallel recognition of LR language suffixes
- Advocating ownership
- Parallel recognition and ranking of context-free languages
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)
- The recognition of deterministic CFLs in small time and space
- 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
- Title not available (Why is that?)
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)
