Revision as of 05:01, 1 June 2014 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →See also ← Previous edit		Revision as of 05:16, 1 June 2014 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →See also Next edit →
Line 296: [[Floyd-Warshall algorithm#Applications and generalizations\|Floyd-Warshall algorithm]] — a related algorithm on weighted graphs [[Generalized star height problem]] — if a complement operator is allowed additionally in regular expressions, can the [[star height#Generalized star height\|stars' nesting depth]] of Kleene's algorithm's output be limited to a fixed bound? *[[Thompson's construction algorithm]] — transforms a regular expression to a finite automaton ==References==

Kleene's algorithm: Difference between revisions