Context-free recognition via shortest paths computation: a version of Valiant's algorithm

DOI10.1016/0304-3975(94)00265-KzbMath0873.68116MaRDI QIDQ673077

Wojciech Rytter

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Parsing by matrix multiplication generalized to Boolean grammars

Cites Work

• General context-free recognition in less than cubic time
• On efficient parallel computations of costs of paths on a grid graph
• Unnamed Item
• Unnamed Item
• Unnamed Item