Optimal parallel recognition of bracket languages on hypercubes

DOI10.1007/BFB0020818MaRDI QIDQ4035690zbMATH OpenFDO

Authors Gisela Pitsch, Elmar Schömer

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020818

zbMATH Keywords

hypercubesparallel recognitionsyntax analysis

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Optimal parallel parsing of bracket languages
• scientific article; zbMATH DE number 4022660
• Parallel recognition and parsing on the hypercube
• scientific article; zbMATH DE number 4126700
• On optimal parallel computations for sequences of brackets
• On the parallel recognition of unambiguous context-free languages
• Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
• Parallel recognition and ranking of context-free languages
• Parallel recognition of rational languages in plane cellular automata
• Parallel time O(log n) recognition of unambiguous context-free languages

Cited in

(3)

• Optimal parallel parsing of bracket languages
• scientific article; zbMATH DE number 3854397 (Why is no real title available?)
• Parallel recognition and ranking of context-free languages

This page was built for publication: Optimal parallel recognition of bracket languages on hypercubes

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