Shortest path with context-free constraints

[gsvgit]

Is it possible to solve CFL constrained shortest path problem by using our matrix-multiplication-based algorithm or its modification?
On CFL constrained shortest path problem.

• A Distributed Context-Free Language Constrained Shortest Path Algorithm
• Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)
• Complexity results on labeled shortest path problems from wireless routing metrics
• Quickest Path Distances on Context-Free Labeled Graphs
• On labeled paths, Nathan Michael Wiegand

[gsvgit]

@rustam-azimov Should be completed and published.