« first day (2874 days earlier)      last day (32 days later) » 

11:38 AM
@Raphael any response from CM about meta post with voting threshold?
 
 
7 hours later…
7:36 PM
5
Q: How hard is finding the shortest path in a graph matching a given regular language?

Aaron RotenbergSuppose we are given a directed graph $G = (V, E)$ with edge weights $w : E \rightarrow \mathbb{R}$ (we can assume there are no negative cycles) and edge labels $\ell : E \rightarrow \Sigma$ from some alphabet $\Sigma$. We are also given a description of an NFA $M$ (or DFA, or regular expression)...

 

« first day (2874 days earlier)      last day (32 days later) »