Theoretical Aspects of Lexical Analysis/Exercise 12: Revision history

5 December 2018

• curprev 22:0222:02, 5 December 2018‎ Root talk contribs‎ 69 bytes −10,853‎ Redirected page to ist:Theoretical Aspects of Lexical Analysis/Exercise 12

6 April 2015

• curprev 14:3614:36, 6 April 2015‎ Root talk contribs‎ 10,922 bytes +2‎ No edit summary

28 April 2009

• curprev 13:5513:55, 28 April 2009‎ Root talk contribs‎ m 10,920 bytes +3‎ No edit summary

30 March 2009

• curprev 13:1213:12, 30 March 2009‎ Root talk contribs‎ 10,917 bytes +10,917‎ 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...