Context-free recognition via shortest paths computation: a version of Valiant's algorithm
From MaRDI portal
Recommendations
- A simple proof of Valiant's lemma
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- scientific article; zbMATH DE number 3978426
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
- Parsing by matrix multiplication generalized to Boolean grammars
Cites work
- scientific article; zbMATH DE number 52889 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- General context-free recognition in less than cubic time
- On efficient parallel computations of costs of paths on a grid graph
Cited in
(6)- If the current clique algorithms are optimal, so is Valiant's parser
- A simple proof of Valiant's lemma
- Parsing by matrix multiplication generalized to Boolean grammars
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
- Efficient Computation of Throughput Values of Context-Free Languages
- Recognizing two-sided contexts in cubic time
This page was built for publication: Context-free recognition via shortest paths computation: a version of Valiant's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673077)
