Solved

Let L={w (0 + 1)* W Has Even Number of 1s}

Question 48

Multiple Choice

Let L={w (0 + 1) * w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?


A) (0*10*1) *
B) 0*(10*10*) *
C) 0*(10*1*) *0*
D) 0*1(10*1) *10*

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and

Q42: Consider the following Finite State Automaton The

Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the

Q44: Which one of the following is true

Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation

Q46: Given A = {0,1} and L =

Q47: A minimum state deterministic finite automation accepting

Q49: Which of the following statements is/are FALSE?<br>(1)

Q50: Which of the following are decidable?<br>1) Whether