Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm

Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer and System Sciences, 10:2 (1975), 308

• Type: Conference
• Year: 2010
• Where: DLT
• Authors: Alexander Okhotin
• Keywords: Boolean Matrices, DLT 2010, General Boolean Grammars, Theoretical Computer Science, Well-known Parsing Algorithm