User contributions for Root
22 March 2009
- 04:1004:10, 22 March 2009 diff hist −50 Theoretical Aspects of Lexical Analysis/Exercise 3 →DFA
- 04:0904:09, 22 March 2009 diff hist −50 Theoretical Aspects of Lexical Analysis/Exercise 4 →DFA
- 04:0704:07, 22 March 2009 diff hist 0 Theoretical Aspects of Lexical Analysis/Exercise 4 →DFA
- 04:0604:06, 22 March 2009 diff hist −20 Theoretical Aspects of Lexical Analysis/Exercise 4 No edit summary
- 04:0504:05, 22 March 2009 diff hist −20 Theoretical Aspects of Lexical Analysis/Exercise 3 No edit summary
- 04:0504:05, 22 March 2009 diff hist −20 Theoretical Aspects of Lexical Analysis/Exercise 2 No edit summary
- 04:0404:04, 22 March 2009 diff hist −10 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 04:0204:02, 22 March 2009 diff hist −25 Theoretical Aspects of Lexical Analysis/Exercise 5 No edit summary
- 04:0004:00, 22 March 2009 diff hist +54 Theoretical Aspects of Lexical Analysis/Exercise 5 No edit summary
- 03:5703:57, 22 March 2009 diff hist 0 Theoretical Aspects of Lexical Analysis/Exercise 5 →Input Analysis
- 03:5603:56, 22 March 2009 diff hist +17 Theoretical Aspects of Lexical Analysis/Exercise 5 No edit summary
- 03:5403:54, 22 March 2009 diff hist +1,742 Theoretical Aspects of Lexical Analysis/Exercise 5 No edit summary
- 03:3803:38, 22 March 2009 diff hist +8,127 N Theoretical Aspects of Lexical Analysis/Exercise 5 New page: Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). The alphabet is Σ = { a, b }. Indicate the nu...
- 02:3702:37, 22 March 2009 diff hist +8 Theoretical Aspects of Lexical Analysis →Exercises
- 02:3502:35, 22 March 2009 diff hist +785 Theoretical Aspects of Lexical Analysis →Exercises
- 02:2302:23, 22 March 2009 diff hist +44 Theoretical Aspects of Lexical Analysis →Exercises
- 01:3801:38, 22 March 2009 diff hist +240 Theoretical Aspects of Lexical Analysis/Exercise 4 No edit summary
- 01:3301:33, 22 March 2009 diff hist +9,489 Theoretical Aspects of Lexical Analysis/Exercise 4 No edit summary
- 00:3100:31, 22 March 2009 diff hist +4 Theoretical Aspects of Lexical Analysis/Exercise 2 →DFA
- 00:3100:31, 22 March 2009 diff hist +5,164 Theoretical Aspects of Lexical Analysis/Exercise 3 No edit summary
- 00:0800:08, 22 March 2009 diff hist +5,400 Theoretical Aspects of Lexical Analysis/Exercise 2 No edit summary
- 00:0600:06, 22 March 2009 diff hist 0 Theoretical Aspects of Lexical Analysis/Exercise 1 →Solution
21 March 2009
- 23:5223:52, 21 March 2009 diff hist +648 Theoretical Aspects of Lexical Analysis/Exercise 1 →DFA
- 23:4623:46, 21 March 2009 diff hist +866 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 23:3123:31, 21 March 2009 diff hist −1,303 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 23:3023:30, 21 March 2009 diff hist +68 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 21:1221:12, 21 March 2009 diff hist +4,507 Theoretical Aspects of Lexical Analysis/Exercise 1 →Solution
- 21:0721:07, 21 March 2009 diff hist +440 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 20:1820:18, 21 March 2009 diff hist +16 Theoretical Aspects of Lexical Analysis/Exercise 3 No edit summary
- 20:1820:18, 21 March 2009 diff hist +16 Theoretical Aspects of Lexical Analysis/Exercise 2 No edit summary
- 20:1820:18, 21 March 2009 diff hist +16 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 20:1720:17, 21 March 2009 diff hist +269 N Theoretical Aspects of Lexical Analysis/Exercise 4 New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>(a|b)*abb(a|b)*</nowiki> == Solution == [[category...
- 20:1720:17, 21 March 2009 diff hist +93 Theoretical Aspects of Lexical Analysis/Exercise 3 No edit summary
- 20:1720:17, 21 March 2009 diff hist +93 Theoretical Aspects of Lexical Analysis/Exercise 2 No edit summary
- 20:1720:17, 21 March 2009 diff hist +93 Theoretical Aspects of Lexical Analysis/Exercise 1 No edit summary
- 20:1620:16, 21 March 2009 diff hist +5 Theoretical Aspects of Lexical Analysis →Exercises
- 20:1620:16, 21 March 2009 diff hist +155 N Theoretical Aspects of Lexical Analysis/Exercise 3 New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>((ε|a)b)*</nowiki>
- 20:1520:15, 21 March 2009 diff hist +153 N Theoretical Aspects of Lexical Analysis/Exercise 2 New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>(a*|b*)*</nowiki>
- 20:1420:14, 21 March 2009 diff hist +151 N Theoretical Aspects of Lexical Analysis/Exercise 1 New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>(a|b)*</nowiki>
- 20:1320:13, 21 March 2009 diff hist +356 Theoretical Aspects of Lexical Analysis No edit summary
- 15:3715:37, 21 March 2009 diff hist −2 Theoretical Aspects of Lexical Analysis No edit summary
- 15:3615:36, 21 March 2009 diff hist −9 Theoretical Aspects of Lexical Analysis →Building DFAs from NFAs
- 15:3415:34, 21 March 2009 diff hist −4 Theoretical Aspects of Lexical Analysis →Building DFAs from NFAs
- 15:3215:32, 21 March 2009 diff hist +1 Theoretical Aspects of Lexical Analysis →Building DFAs from NFAs
- 15:3215:32, 21 March 2009 diff hist +1 Theoretical Aspects of Lexical Analysis →Building the NFA: Thompson's Algorithm
- 15:3115:31, 21 March 2009 diff hist +14 Theoretical Aspects of Lexical Analysis →Building the NFA: Thompson's Algorithm
- 11:4211:42, 21 March 2009 diff hist −6 Theoretical Aspects of Lexical Analysis →Thompson's Algorithm and the NFA
- 11:4211:42, 21 March 2009 diff hist −6 Theoretical Aspects of Lexical Analysis →Building DFAs from NFAs