A parallel algorithm for counting parse trees

DOI10.1016/J.IC.2024.105237MaRDI QIDQ7021353zbMATH OpenFDO

Authors Margarita Mikhelson, Alexander Okhotin

Publication date 28 February 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2024.105237

zbMATH Keywords

context-free grammarsmatrix multiplicationparallel algorithmsparsingweighted grammars

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Grammars and rewriting systems (68Q42) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites work

• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Formal languages over GF(2)
• Gaussian elimination is not optimal
• General context-free recognition in less than cubic time
• scientific article; zbMATH DE number 3978426 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 7733588 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• New bounds for matrix multiplication: from alpha to omega
• Parsing by matrix multiplication generalized to Boolean grammars
• The dynamic complexity of formal languages

This page was built for publication: A parallel algorithm for counting parse trees

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