Is the answer c?

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

The regular expression denoting the set of all strings not containing two consecutive 1's is given by

A) (0+10)*(EPSILON+0)

B) (1+01)*

C) (0+10)*(EPSILON+1)

D) (EPSILON+0)(001)*(EPSILON+0)

A) (0+10)*(EPSILON+0)

B) (1+01)*

C) (0+10)*(EPSILON+1)

D) (EPSILON+0)(001)*(EPSILON+0)

0

I guess option c is right because

Option A : We cannot generate string 1,01,or 101 etc

Option B : We cannot generate string 0 , 10 and so on

Option D : We cannot generate string 1, 10 etc

Option A : We cannot generate string 1,01,or 101 etc

Option B : We cannot generate string 0 , 10 and so on

Option D : We cannot generate string 1, 10 etc

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 6k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,976 questions

47,609 answers

146,779 comments

62,342 users