Fast parallel recognition of LR language suffixes

DOI10.1016/J.IPL.2004.08.010MaRDI QIDQ834947zbMATH OpenOpenAlexFDO

Authors E. Bertsch, Mark-Jan Nederhof

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.08.010

zbMATH Keywords

computational complexityprogramming languagesparallel algorithms

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 3926247 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
• Fast recognition of deterministic cfl's with a smaller number of processors
• Linear-time suffix parsing for deterministic languages
• Noncorrecting syntax error recovery
• On efficient parallel computations of costs of paths on a grid graph
• On the complexity of parallel parsing of general context-free languages
• On the parallel recognition of unambiguous context-free languages
• Parallel RAMs with owned global memory and deterministic context-free language recognition
• Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
• Parallel time O(log n) recognition of unambiguous context-free languages
• Regular Closure of Deterministic Languages

Cited in

(1)

• scientific article; zbMATH DE number 3926273 (Why is no real title available?)

This page was built for publication: Fast parallel recognition of LR language suffixes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834947)