Theory Of Computation Test – Question 9

Consider the following language over the alphabet {0,1}.

L={ xy|x has even number of 1’s, y has an even number of 0’s}

Which is True for L ?

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

Leave a Reply

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