Theoretical Aspects of Lexical Analysis/Exercise 8: Revision history

5 December 2018

• curprev 22:0122:01, 5 December 2018‎ Root talk contribs‎ 68 bytes −10,897‎ Redirected page to ist:Theoretical Aspects of Lexical Analysis/Exercise 8

6 April 2015

• curprev 14:3914:39, 6 April 2015‎ Root talk contribs‎ 10,965 bytes +2‎ No edit summary

28 March 2009

• curprev 20:4320:43, 28 March 2009‎ Root talk contribs‎ 10,963 bytes +10,963‎ New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...