Transcript
Computations in a semi-ring
Given a weighted graph, find the shortest path connecting any two vertices
Given a graph, find its transitive closure Given a finite automaton, find the REGEX
describing its language
Computations in a semi-ring
Given a weighted graph, find the shortest path connecting any two vertices
Given a graph, find its transitive closure Given a finite automaton, find the REGEX
describing its language