The Gateway to Computer Science Excellence
0 votes
68 views

Doubt 1:

according to me L1 should be subset of L2. But answer is d) L1,L2,L3 are incomparable. Please explain this question to me

 

 

Doubt 2:

which type of language is L4?

in Theory of Computation by Active (2.2k points)
edited by | 68 views
+1
Doubt 1:

L1 should be subset of L2 for a,b,c and not for d

for 'd' L2 is a subset of L1

Doubt 2:

Anything with Kleen closer is regular

regular.CSL=CSL

2 Answers

0 votes
Q(1)  L1={$\varepsilon$,abcd,abcdd,aabbccdd,aabbccdddd,aabbccdddd,........}

L2={$\varepsilon$,aabbccd,aabbccdd,aaaabbbbccccd,aaaabbbbccccdd.........}

L3={$\varepsilon$,aabbcdd,aabbcccdd,................}

how can we say that$L2\subseteq L1$ or $L1\subseteq L2$ if it does then all the language generated by L2 must be in L1 or all the language which is generated by L1 must be in L1 but we can see all are generating different except some of string .

 

Q(2) it will be CSL
by Active (2.8k points)
0
for question 2 I also think it is CSL but answer given was Regular language.
0
any explanation given?
0
No. only answer is given
0

Doubt 2 

L4 must be regular.

0 votes

Doubt 2 

L4 must be regular.

by Boss (35.3k points)
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,650 questions
56,192 answers
193,988 comments
94,853 users