Is it option C?

The Gateway to Computer Science Excellence

0 votes

0

L1 would have been regular if n had a fixed value. But it is not regular here.

L2 is regular because {Regular}^{* }is regular

Option(C)

0

Let's say n=4

L1: if after iterating x four times it belongs to the set A (which is regular)

If the condition is true it will be accepted else rejected

L1: if after iterating x four times it belongs to the set A (which is regular)

If the condition is true it will be accepted else rejected

0

For L1.

Suppose {x = 0^{i}1^{j} / i==j and i,j>=0}

and {y = (o^{i}1^{j})^{*}/ i,j>=0} we are taking kleen closure because n>=0. and note that y is a complete language over 0 and 1, hence y contain kleen closure of x's string.

now here x is DCFL and y is regular.

there for L1 is not Regular.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,833 questions

57,697 answers

199,346 comments

107,400 users