Revision as of 18:36, 31 May 2014 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →Algorithm description ← Previous edit		Revision as of 18:39, 31 May 2014 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →Algorithm description Next edit →
Line 17: After that, in each step the expressions ''R''{{su\|p=''k''\|b=''ij''}} are computed from the previous ones by :''R''{{su\|p=''k''\|b=''ij''}} = ''R''{{su\|p=''k''-1\|b=''ik''}} (''R''{{su\|p=''k''-1\|b=''kk''}})<sup>*</sup> ''R''{{su\|p=''k''-1\|b=''kj''}} \| ''R''{{su\|p=''k''-1\|b=''ij''}} ==Example== [[File:Deterministicfiniteautomaton.svg\|thumb\|200px\|Example DFA given to Kleene's algorithm]] ==References==

Kleene's algorithm: Difference between revisions