Let L={ w in(0 + 1)* 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*

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter4: Making Decisions
Section: Chapter Questions
Problem 9RQ
icon
Related questions
Question

Let L={ w in(0 + 1)* 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*

Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage