1. Convert the given Ɛ-NFA to NFA 2. Write regular expressions for the following languages: {w | w contains at least two 0s} {w | w begins with a 1 and ends with a 0} 1∑ * 0 {w | w contains at least...

1.   Convert the given Ɛ-NFA to NFA                2.   Write regular expressions for the following languages:  {w | w contains at least two 0s}   {w | w begins with a 1 and ends with a 0} 1∑ * 0   {w | w contains at least three 1s    {w | the length of w is at most 5   {w | w contains an even number of 0s, or contains exactly two 1s} Even number of 0s:


Extracted text: start a.c 9.