Path querying with conjunctive grammars by matrix multiplication

DOI10.1134/S0361768819070041zbMath1455.68077OpenAlexW2995253733MaRDI QIDQ2217207

Semyon Grigorev, Rustam Azimov

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768819070041

zbMATH Keywords

graphsstatic analysistransitive closurematrix multiplicationGPGPUconjunctive grammarspath querying

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Grammars and rewriting systems (68Q42)

Uses Software

• F#

Cites Work

• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Regular path queries with constraints
• Regular queries on graph databases
• Specification Inference Using Context-Free Language Reachability
• Formal-Language-Constrained Path Problems
• Context-sensitive data-dependence analysis via linear conjunctive language reachability
• Recognition and parsing of context-free languages in time n3
• Unnamed Item

This page was built for publication: Path querying with conjunctive grammars by matrix multiplication