The Gateway to Computer Science Excellence
0 votes
96 views

Image may contain: text

in Theory of Computation by Junior (523 points) | 96 views
0
Is it option C?
0
I think it should be C.
0

doubt : In L1 , Lhas elements x. The relation is given as y = x? what will L1 have?

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

Say n has fixed value in L. What strings will Lhave in it?

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
0

For L1.

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

and {y = (oi1j)*/ 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.

0
ohh :o

Okay so it's like .. x4 should also belong to A. Only then it'll be accepted. And only then that string is included in L1 ,right?

Shouldn't the language be

L1 = { y | ..... } ?

@srivivek95
0

L1 is clearly mentioned to contain x.

L= { y | ..... } ?

is not true.

0
Okay

1 Answer

0 votes
The answer should be C)

L1 is bot regular but L2 is regular.
by Junior (523 points)
0
plz any one explain properly i m not geting how they both language are diffrent

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,654 questions
56,166 answers
193,872 comments
94,261 users