I am trying to look answer for this question of toc please help me find the answer. The question is : Construct epsilon NFA(Non deterministic finite automata) for regular expression (0+1)*1(0+1)
Asked
Active
Viewed 23 times
0
-
Start with the easy parts: (0+1). Make one (0+1)*. Can you fill the gap? – greybeard May 27 '23 at 16:10
-
https://cs.stackexchange.com/a/13606/755 – D.W. May 27 '23 at 16:15