34,279 views

2 Answers

Best answer
6 votes
6 votes

Correct answer would be D) (1 + 01)* (0 + λ) 

Strings 010010 can be generated with option (a) by using 010 twice.

String 1001 can be generated with option (b).

string 0100 can be generated with option (c).

So except d) option all can generate strings with 00 as a substring.

selected by
1 votes
1 votes

Answer D)

The Language here is L={⋋,0,1,01,011,101,0101..................}

But

for A) 010010 possible

B)1001 possible

C)0100 possible

These all violates the condition for no pair of consecutive 0

edited by

Related questions

3 votes
3 votes
3 answers
2
Durgesh Singh asked Jul 25, 2017
5,464 views
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
4 votes
4 votes
1 answer
3
Garrett McClure asked Oct 9, 2017
1,223 views
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...