Theory of Computation20795 marksNumerical: Regular expression to automataReduction of Regular Expression to ε – NFA
Convert the following regular expression into equivalent Finite Automata. a.(0+1)∗10(1+0)a. (0+1)*10(1+0)a.(0+1)∗10(1+0)b.1∗0(0+1)∗1b. 1*0(0+1)*1b.1∗0(0+1)∗1
Convert the following regular expression into equivalent Finite Automata. a.(0+1)∗10(1+0)a. (0+1)10(1+0)a.(0+1)∗10(1+0)b.1∗0(0+1)∗1b. 10(0+1)*1b.1∗0(0+1)∗1[5]
Two regular expressions to convert to Finite Automata: - (a) $(0+1)^,1,0,(1+0)$ - (b) $1^,0,(0+1)^,1$ Alphabet: $\Sigma = {0, 1}$ for both. --- Break into parts: 1. $(0+1)^$ = any string of 0s and 1s (including empty) 2. $10$ = literal "10" 3. $(1+0)$ = one symbol, either 0 or 1 Construct...