scientific article; zbMATH DE number 4205991

MaRDI QIDQ3355240zbMATH OpenFDO

Authors Michal Chytil, Burkhard Monien

Publication date 1990

zbMATH Keywords

CREW-PRAMindex of context-free languagesparallel algorithmrecognition of context-free languagesunambiguous languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• On the parallel recognition of unambiguous context-free languages
• Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
• The inherent ambiguity partial algorithm problem for context free languages
• Parallel time O(log n) recognition of unambiguous context-free languages
• scientific article; zbMATH DE number 3917742

Cited in

(9)

• Rational index of languages with bounded dimension of parse trees
• Synchronizing automata over nested words
• Deterministic Caterpillar Expressions
• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
• Parallel recognition and ranking of context-free languages
• Rational index of languages defined by grammars with bounded dimension of parse trees
• Fast recognition of deterministic cfl's with a smaller number of processors
• On the parallel recognition of unambiguous context-free languages
• Convergence of Newton's method over commutative semirings

This page was built for publication:

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