Студентка бакалавриата СПбГУ.
Context-Free Path Querying via Matrix Equations
Modification of Valiant’s algorithm for the string-matching problem
Susanina Y.A., Yaveyn A.N., Grigorev S.V.
This paper aims to present Valiant’s algorithm modification, which main advantage is the possibility to divide the parsing table into successively computed layers of disjoint submatrices where each submatrix of the layer can be processed independently. Moreover, our approach is easily adapted for the string-matching problem.