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

DOI10.1016/0020-0190(92)90212-EzbMath0764.68053OpenAlexW2046689475MaRDI QIDQ1209354

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)

Related Items (3)

Unambiguous Boolean grammars ⋮ Formal languages over GF(2) ⋮ Sublogarithmic ambiguity

Cites Work

• On the parallel recognition of unambiguous context-free languages
• Parallel time O(log n) recognition of unambiguous context-free languages
• Unnamed Item
• Unnamed Item

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