Observations on (n) time parallel recognition of unambiguous cfl's

DOI10.1016/0020-0190(92)90212-EzbMATH Open0764.68053OpenAlexW2046689475MaRDI QIDQ1209354FDOQ1209354

Peter Rossmanith, Wojciech Rytter

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90212-e

zbMATH Keywords

CREW PRAMunambiguous context-free languagesparallel recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)

Cites Work

• Parallel time O(log n) recognition of unambiguous context-free languages
• On the parallel recognition of unambiguous context-free languages
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Unambiguous Boolean grammars
• Sublogarithmic ambiguity
• Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
• Formal languages over GF(2)

Recommendations

• Parallel time O(log n) recognition of unambiguous context-free languages 👍 👎
• Parallel recognition and ranking of context-free languages 👍 👎
• On the parallel recognition of unambiguous context-free languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's

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