Theory Of Computation Test – Question 4

Consider the language

Consider the following sentences about the above language 

  1.  is Finite
  2. The minimal DFA that accepts  has 3 states.
  3. The regular expression for  is  
  4. The regular expression for  is  

Which of the above statements are correct?

  • 1.
  • 2.
  • 3.
  • 4.

Leave a Reply

Your email address will not be published. Required fields are marked *