| http://www.w3.org/ns/prov#value | - We draw an edge from [S] to [T], with label a, if dS/da = T. This graph is none other than the graph of the finite state automaton to recognise matches with R.The catch is recognising when [S]=[T], ie. when S and T match the same strings.
|
