Assertion: floyd warshall algorithm | /r/RelatedTo | kleene's algorithm
Facets:
value: for converting a deterministic finite automaton
type: PURPOSE
value: closely
type: DEGREE
Source sentences:
text: However, it is essentially the same as algorithms previously published by Bernard Roy in 1959 and also by Stephen Warshall in 1962 for finding the transitive closure of a graph, and is closely related to Kleene's algorithm (published in 1956) for converting a deterministic finite automaton into a regular expression.