Register

How to solve?

Recent questions tagged identify-class-language

2 votes
3 answers
183
Identify the class of L
Consider $L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$ $L_2 = \left\{a^nb^n \mid n \ge1\right\}$ $L_3 = \left\{(a+b)^*\right\}$ $L_1$ - $L_3$ is (A) Regular (B) CFL but not regular (C) CSL but not CFL (D) None of these
Consider$L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$$L_2 = \left\{a^nb^n \mid n \ge1\right\}$$L_3 = \left\{(a+b)^*\right\}$$L_1$ - $L_3$ is(A) Regular (B) CFL but n...
User Avatar
0 votes
1 answer
188
type of language
let L=(a,b,c)* | the length of x is square then L is - a)Regular b)recursive but not context free c)context free but not regular d)none of these.
let L=(a,b,c)* | the length of x is square then L is -a)Regularb)recursive but not context freec)context free but not regulard)none of these.
User Avatar
0 votes
2 answers
189
Dcfl or not
L={w0w $\mid$ w$\in$(0+a+b)*}
L={w0w $\mid$ w$\in$(0+a+b)*}
User Avatar
0 votes
1 answer
190
regular or context free ?
(a+b)^* a^n b^n n>=1
(a+b)^* a^n b^n n>=1
User Avatar
0 votes
1 answer
193
Class of language
Identify the class of this language - L = { w1w2 | w1 != w2 & |w1| = |w2|} A) Regular B) CFL C) CSL D) Rec
Identify the class of this language -L = { w1w2 | w1 != w2 & |w1| = |w2|}A) RegularB) CFLC) CSLD) Rec
User Avatar
12 votes
1 answer
194
Why this is not a regular language?
Consider following languages : L1 = { wxwy | x,w,y $\in$(a + b)+ } , L2 = { xwyw | x,w,y $\in$(a + b)+ } , L3 = { wxyw | x, y, w $\in$(a+b)+ } How can we say that L1 , L2 are regular but not L3 ? Please explain.
Consider following languages :L1 = { wxwy | x,w,y $\in$(a + b)+ } ,L2 = { xwyw | x,w,y $\in$(a + b)+ } ,L3 = { wxyw | x, y, w $\in$(a+b)+ } How can we say that L1 , L2 ar...
User Avatar
4 votes
2 answers
196
DCFL
Is DFCL closed under complement ? If so can you provide any text for the same.
Is DFCL closed under complement ? If so can you provide any text for the same.
User Avatar
5 votes
2 answers
199
how to identify whether a language is Context free or Context sensitive
Which of the following language is $CFL$? a. $\{a^mb^nc^n\;|\;m!=n\}$ b. $\{a^mb^nc^k\;|\;if\,(m=n)\,then\,(n!=k)\}$ c. $\{a^mb^nc^k\;|\;m>n\;or\;n<k\}$ d. None of these
Which of the following language is $CFL$?a. $\{a^mb^nc^n\;|\;m!=n\}$b. $\{a^mb^nc^k\;|\;if\,(m=n)\,then\,(n!=k)\}$c. $\{a^mb^nc^k\;|\;m>n\;or\;n<k\}$d. None of these
User Avatar
1 votes
1 answer
200
Regular/ Non Regular . Why is L2 not regular ?
L1 = {ambn | m+n = Even} L2 = {ambn | m-n = 4} (a) L1 is Regular, L2 is Not Regular (b) Both are Regular (c) Both are Non- Regular (d) L2 is Regular, L1 is Not Regular
L1 = {ambn | m+n = Even} L2 = {ambn | m-n = 4}(a) L1 is Regular, L2 is Not Regular(b) Both are Regular(c) Both are Non- Regular(d) L2 is Regular, L1 is Not Regular
User Avatar
21 votes
5 answers
206
GATE CSE 1991 | Question: 17,a
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
User Avatar
1 votes
3 answers
210
Identify the class of the language
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$     Identify the class of the language.
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$    Identify the class of the language.
User Avatar
Page: