Theoretical Aspects of Lexical Analysis/Exercise 16: Revision history

12 February 2019

• curprev 10:3110:31, 12 February 2019 Root talk contribs 15,875 bytes −87 No edit summary

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 }...