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.6k
- Engineering Mathematics 7.3k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.4k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 570
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 70
- Projects 18

48,720 questions

52,817 answers

183,476 comments

68,569 users