A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
a. (1 + 010)*
b. (01 + 10)*
c. (1 + 010)* (0 + λ)
d. (1 + 01)* (0 + λ)
Answer:(1 + 01)* (0 + λ)
nimisha :(September 10, 2019) explain please...
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: