1,115 views
0 votes
0 votes

Convert the following regular expression (0+11)0*1 to NFA with e-transitions using the procedure given on pg. 66-67 Theorem 1.54 (Lemma 1.55) of the Introduction to Theory of Computation 3rd edition book by Michael Sipser.   

I followed the example in the book, but what confuses me is when the Kleene star is added individually like 0*, how would we illustrate this? 

This was my approach for just 0*1 part:

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
743 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
2 answers
4