The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

hi,

as u r saying l, m does not depend upon n and k but in the given condition it is mentioned dat.. m=l, m, n, k so all of them should accept equal no. of l,m, n and k..!!

as u r saying l, m does not depend upon n and k but in the given condition it is mentioned dat.. m=l, m, n, k so all of them should accept equal no. of l,m, n and k..!!

@ Praveen Saini can you explain L1 once

+4 votes

Best answer

**L1 = {0 ^{n+m}1^{k+l} | m = l, m, n, k, l >=1}**

We can write it as

L1 = {0

L1 = {0

**L2 = {0 ^{n}(11)^{m} | m,n >=0}**

Any number of zeros followed by even number of 1's, its regular.

According to me option D is correct, both L1 and L2 are regular.

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 4.7k
- Digital Logic 1.9k
- Programming & DS 3.5k
- Algorithms 3k
- Theory of Computation 3.7k
- Compiler Design 1.5k
- Databases 2.8k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 837
- Others 1.2k
- Admissions 284
- Exam Queries 398
- Tier 1 Placement Questions 17
- Job Queries 51
- Projects 7

33,712 questions

40,255 answers

114,366 comments

38,881 users