Revision as of 05:16, 1 June 2014 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →See also ← Previous edit		Revision as of 06:18, 1 June 2014 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →Algorithm description: wikilink Next edit →
Line 3: ==Algorithm description== According to Gross and Yellen (2004),<ref>{{cite book\| title=Handbook of Graph Theory\| year=2004\| volume=\| publisher=CRC Press\| editor=Jonathan L. Gross and Jay Yellen\| series=Discrete Mathematics and it Applications\| isbn=1-58488-090-2}} Here: sect.2.1, remark R13 on p.65</ref> the algorithm can be traced back to [[Kleene]] (1956).<ref>{{cite journal\| author=Kleene, Stephen C.\| title=Representation of Events in Nerve Nets and Finite Automate\| journal=Automata Studies, Annals of Math. Studies\| year=1956\| volume=34\| publisher=Princeton Univ. Press\| url=http://www.dlsi.ua.es/~mlf/nnafmc/papers/kleene56representation.pdf}}</ref> This description follows Hopcroft and Ullman (1979).<ref>{{cite book\| author=John E. Hopcroft, Jeffrey D. Ullman\| title=Introduction to Automata Theory, Languages, and Computation\| year=1979\| publisher=Addison-Wesley\| isbn=0-201-02988-X}} Here: Theorem 2.4, p.33-34</ref>

Kleene's algorithm: Difference between revisions