Graduated in 2016 from the Saint-Petersburg State University, Mathematics & Mechanics Faculty, Software Engineering Department with a bachelor's degree.
Currently, Rustam is a master’s student at SPbU, Mathematics & Mechanics Faculty.
- Graph parsing
- Functional programming
Programming and Computer Software, December 2019
Path querying with conjunctive grammars is known to be undecidable. There is an algorithm for path querying with linear conjunctive grammars which provides an over-approximation of the result, but there is no algorithm for arbitrary conjunctive grammars. We propose the first algorithm for path querying with arbitrary conjunctive grammars. The proposed algorithm is matrix-based and allows us to efficiently apply GPGPU computing techniques and other optimizations for matrix operations.
Programming Languages and Tools Lab Researcher
- Formal Languages and Syntax Analysis