Theoretical Aspects of Lexical Analysis/Exercise 16: Revision history

5 December 2018

• curprev 22:0322:03, 5 December 2018‎ Root talk contribs‎ 69 bytes −15,893‎ Redirected page to ist:Theoretical Aspects of Lexical Analysis/Exercise 16

6 April 2015

• curprev 14:3714:37, 6 April 2015‎ Root talk contribs‎ 15,962 bytes +2‎ No edit summary

22 April 2010

• curprev 19:1319:13, 22 April 2010‎ Root talk contribs‎ 15,960 bytes +15,960‎ 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, c }...