Theoretical Aspects of Lexical Analysis/Exercise 6: Revision history

5 December 2018

• curprev 21:5921:59, 5 December 2018‎ Root talk contribs‎ 68 bytes −12,445‎ Redirected page to ist:Theoretical Aspects of Lexical Analysis/Exercise 6

5 March 2016

• curprev 10:3610:36, 5 March 2016‎ Root talk contribs‎ 12,513 bytes −18‎ →‎DFA
• curprev 10:3410:34, 5 March 2016‎ Root talk contribs‎ 12,531 bytes +30‎ →‎DFA
• curprev 10:3210:32, 5 March 2016‎ Root talk contribs‎ 12,501 bytes +55‎ →‎NFA

6 April 2015

• curprev 14:3814:38, 6 April 2015‎ Root talk contribs‎ 12,446 bytes +2‎ No edit summary

28 March 2009

• curprev 17:4017:40, 28 March 2009‎ Root talk contribs‎ 12,444 bytes +30‎ No edit summary

22 March 2009

• curprev 18:1718:17, 22 March 2009‎ Root talk contribs‎ 12,414 bytes +1,766‎ No edit summary
• curprev 04:4804:48, 22 March 2009‎ Root talk contribs‎ 10,648 bytes +6‎ →‎Input Analysis
• curprev 04:4604:46, 22 March 2009‎ Root talk contribs‎ 10,642 bytes +1‎ →‎DFA
• curprev 04:4604:46, 22 March 2009‎ Root talk contribs‎ 10,641 bytes +103‎ →‎DFA
• curprev 04:4404:44, 22 March 2009‎ Root talk contribs‎ 10,538 bytes +10,538‎ 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...