Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-free-language
1
votes
2
answers
541
UGC NET CSE | June 2012 | Part 3 | Question: 39
The following CFG $S \rightarrow aB \mid bA, A \rightarrow a \mid as \mid bAA, B \rightarrow b \mid bs \mid aBB$ generates strings of terminals that have odd number of a’s and odd number of b’s even number of a’s and even number of b’s equal number of a’s and b’s not equal number of a’s and b’s
The following CFG $S \rightarrow aB \mid bA, A \rightarrow a \mid as \mid bAA, B \rightarrow b \mid bs \mid aBB$ generates strings of terminals that haveodd number of a�...
go_editor
2.7k
views
go_editor
asked
Jul 7, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
context-free-language
+
–
3
votes
2
answers
542
UGC NET CSE | June 2012 | Part 3 | Question: 32
The equivalent grammar corresponding to the grammar $G:S \rightarrow aA, A \rightarrow BB, B \rightarrow aBb \mid \varepsilon$ is $S \rightarrow aA, A \rightarrow BB, B \rightarrow aBb$ ... $S \rightarrow a \mid aA, A \rightarrow BB \mid B , B \rightarrow aBb \mid ab$
The equivalent grammar corresponding to the grammar $G:S \rightarrow aA, A \rightarrow BB, B \rightarrow aBb \mid \varepsilon$ is$S \rightarrow aA, A \rightarrow BB, B \r...
go_editor
5.3k
views
go_editor
asked
Jul 7, 2016
Theory of Computation
theory-of-computation
grammar
context-free-language
ugcnetcse-june2012-paper3
+
–
2
votes
0
answers
543
Among these language which is/are Context free Language and has Context Free Grammar ?
Among these languages which is/are Context free Language and has Context Free Grammar ? please Explain the reason a little bit . 1 .LISP 2 .C-Language 3 .C++ Language 4 .Cobol
Among these languages which is/are Context free Language and has Context Free Grammar ? please Explain the reason a little bit .1 .LISP2 .C-Language3 .C++ Language4 .Cobo...
shekhar chauhan
732
views
shekhar chauhan
asked
Jul 5, 2016
Compiler Design
context-free-language
compiler-design
+
–
1
votes
2
answers
544
network 200.20.11.144/27 , Which of the following languages are context free
In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is____ Which of the following languages are context free? $L_1=\{a^mb^na^nb^m \mid m,n \geq 1\}$ $L_2=\{a^mb^na^mb^m \mid m,n \geq 1\}$ $L_3=\{a^mb^n \mid m= 2n+1\}$
In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is____Which of the following language...
Sanjay Sharma
971
views
Sanjay Sharma
asked
Jul 2, 2016
Theory of Computation
context-free-language
+
–
7
votes
4
answers
545
ISRO2011-68
Which of the following sentences can be generated by S -> aS $\mid$ bA A -> d $\mid$ cA bccdd abbcca abcabc abcd
Which of the following sentences can be generated by S - aS $\mid$ bAA - d $\mid$ cAbccddabbccaabcabcabcd
go_editor
5.1k
views
go_editor
asked
Jun 23, 2016
Theory of Computation
isro2011
theory-of-computation
context-free-language
grammar
+
–
3
votes
1
answer
546
TOC CFG
If language $L=\{a^n b^n \mid n \geq 0\}$, then language $L^2$ is given by $\{a^{2n} b^{2n} \mid n \geq 0\}$ $\{a^n b^n a^n b^n \mid n \geq 0\}$ $\{a^n b^n \mid n \geq 0\}$ $\{a^n b^n a^m b^m \mid n, m \geq 0\}$
If language $L=\{a^n b^n \mid n \geq 0\}$, then language $L^2$ is given by$\{a^{2n} b^{2n} \mid n \geq 0\}$$\{a^n b^n a^n b^n \mid n \geq 0\}$$\{a^n b^n \mid n \geq 0\}$$...
himanich
596
views
himanich
asked
Jun 22, 2016
Theory of Computation
theory-of-computation
grammar
context-free-language
+
–
1
votes
2
answers
547
Toc CFG
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ in Chomsky normal form Greibach normal form Simple form None of the above
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ inChomsky normal formGreibach norma...
shaff
524
views
shaff
asked
Jun 21, 2016
Theory of Computation
theory-of-computation
grammar
context-free-language
+
–
0
votes
1
answer
548
TOC , Language ,PDA
What does this Language Represents ? And what is the machine which is able to represent this Language. L = { a^i b^j c^k d^l } where i = k or j = l How it is different from L = {a^m b^n c^m d^n}
What does this Language Represents ? And what is the machine which is able to represent this Language.L = { a^i b^j c^k d^l } where i = k or j = lHow it is different fro...
shekhar chauhan
2.2k
views
shekhar chauhan
asked
Jun 15, 2016
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
+
–
6
votes
7
answers
549
ISRO2008-7
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
Consider the grammar$S \rightarrow ABCc \mid bc$$BA \rightarrow AB$$Bb \rightarrow bb$$Ab \rightarrow ab$$Aa \rightarrow aa$Which of the following sentences can be derive...
go_editor
9.9k
views
go_editor
asked
Jun 10, 2016
Theory of Computation
isro2008
theory-of-computation
context-free-language
grammar
+
–
1
votes
1
answer
550
UGC NET CSE | June 2014 | Part 2 | Question: 09
The context free grammar for the language $L= \left\{a^{n}b^{m}c^{k} \mid k = \mid n - m\mid , n \geq 0, m \geq 0, k \geq 0\right\}$ ...
The context free grammar for the language $L= \left\{a^{n}b^{m}c^{k} \mid k = \mid n - m\mid , n \geq 0, m \geq 0, k \geq 0\right\}$ is $S \rightarrow S_{1}S_{3}, S_{1} \...
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Jun 8, 2016
Theory of Computation
ugcnetcse-june2014-paper2
theory-of-computation
context-free-language
+
–
1
votes
2
answers
551
Automata Language PDA
If a given CFL Language is L= {a^n b^n ;n>=0} then how can we determine the value of L^2 .Explain with an example .
If a given CFL Language is L= {a^n b^n ;n>=0} then how can we determine the value of L^2 .Explain with an example .
shekhar chauhan
906
views
shekhar chauhan
asked
Jun 6, 2016
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
+
–
2
votes
3
answers
552
UGC NET CSE | December 2015 | Part 3 | Question: 28
Given the following two languages: $L_1=\{a^nba^n\;|\;n>0\}$ $L_2=\{a^nba^nb^{n+1}\;|\;n>0\}$ Which of the following is correct? $L_1$ is context free language and $L_2$ is not context free language $L_1$ is ... $L_2$ is context free language Both $L_1$ and $L_2$ are context free languages Both $L_1$ and $L_2$ are not context free languages
Given the following two languages:$L_1=\{a^nba^n\;|\;n>0\}$$L_2=\{a^nba^nb^{n+1}\;|\;n>0\}$Which of the following is correct? $L_1$ is context free language and $L_2$ is ...
Deepak jain
3.5k
views
Deepak jain
asked
Jun 4, 2016
Theory of Computation
identify-class-language
context-free-language
ugcnetcse-dec2015-paper3
+
–
3
votes
1
answer
553
Is this language be accepted by 2 stack PDA L={a^n b^m c^n d^m / n>=m}
Don't you worry
4.4k
views
Don't you worry
asked
Jun 1, 2016
Theory of Computation
theory-of-computation
context-free-language
pushdown-automata
+
–
12
votes
1
answer
554
ISI2015-PCB-CS-5b
Construct a context free grammar (CFG) to generate the following language: $L = \{a^nb^mc^{n+m}: \text{n, m are integers, and } n \geq 1, m \geq 1 \}$
Construct a context free grammar (CFG) to generate the following language:$L = \{a^nb^mc^{n+m}: \text{n, m are integers, and } n \geq 1, m \geq 1 \}$
go_editor
1.2k
views
go_editor
asked
May 30, 2016
Theory of Computation
descriptive
isi2015-pcb-cs
theory-of-computation
context-free-language
+
–
3
votes
1
answer
555
Which of these languages are NOT context free?
Let $l1 =\{ 0^{n+m} 1^n 0^m \mid n,m>= 0 \}$, $l2 = \{ 0^{n+m} 1^{n+m} 0^m \mid n,m>=0 \}$ , $l3 = \{ 0^{n+m} 1^{n+m} 0^{n+m} \mid n,m>=0 \}$ Which of these languages are NOT context free? Solve this question with explanation Thank you
Let$l1 =\{ 0^{n+m} 1^n 0^m \mid n,m>= 0 \}$,$l2 = \{ 0^{n+m} 1^{n+m} 0^m \mid n,m>=0 \}$ ,$l3 = \{ 0^{n+m} 1^{n+m} 0^{n+m} \mid n,m>=0 \}$Which of these languages are NOT...
Lohithendra Kumar
3.8k
views
Lohithendra Kumar
asked
Mar 10, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
59
votes
8
answers
556
GATE CSE 2016 Set 1 | Question: 42
Consider the following context-free grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generated by $G_1$ and $G_2$ ... $\{ a^mb^n \mid m > 0 \text{ or } n>0\}$
Consider the following context-free grammars;$G_1 : S \to aS \mid B, B \to b \mid bB$$G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$W...
Sandeep Singh
26.5k
views
Sandeep Singh
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
51
votes
5
answers
557
GATE CSE 2016 Set 1 | Question: 16
Which of the following languages is generated by the given grammar? $S \rightarrow aS \mid bS \mid \varepsilon$ $\{ a^nb^m \mid n,m \geq 0\}$ $\{ w \in \{ a,b\}^* \mid w\text{ has equal number of a's and b's}\}$ $\{a^n \mid n \geq 0 \} \cup \{b^n \mid n \geq 0\} \cup \{a^n b^n \mid n \geq 0\}$ $\{ a,b\}^*$
Which of the following languages is generated by the given grammar?$$S \rightarrow aS \mid bS \mid \varepsilon$$$\{ a^nb^m \mid n,m \geq 0\}$$\{ w \in \{ a,b\}^* \mid w\t...
Sandeep Singh
12.0k
views
Sandeep Singh
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
50
votes
5
answers
558
GATE CSE 2016 Set 2 | Question: 43
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are context-free. $L_{1}$ is context ... $L_{2}$ is context-free while $L_{1}$ is not context-free. Neither $L_{1}$ nor $L_{2}$ is context-free.
Consider the following languages:$L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$$L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$Which one of the following is TRUE?Bot...
Akash Kanase
20.9k
views
Akash Kanase
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set2
theory-of-computation
context-free-language
normal
+
–
48
votes
2
answers
559
GATE CSE 2016 Set 2 | Question: 18
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRUE ? $\overline{L_{3}} \cup L_{4}$ ... is context-free. I only. I and III only. I and IV only. I, II and III only.
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRU...
Akash Kanase
12.0k
views
Akash Kanase
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set2
theory-of-computation
regular-language
context-free-language
closure-property
normal
+
–
5
votes
4
answers
560
If L1 is Regular, and L1UL2 is regular, then L2 is?
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular. (a) L2 is definitely regular (b) L2 may not be regular (c) L2 is context free (d) None of above Is it option B or C? How?
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular.(a) L2 is definitely regular(b) L2 may not be regular(c) L2 is context free(d) None of aboveIs it option B ...
Purple
8.8k
views
Purple
asked
Jan 28, 2016
Theory of Computation
theory-of-computation
identify-class-language
regular-language
non-regular
context-free-language
+
–
0
votes
0
answers
561
CFG regular or NOT
How to identify regular CFG
How to identify regular CFG
Pradip Nichite
333
views
Pradip Nichite
asked
Jan 21, 2016
Databases
theory-of-computation
context-free-language
regular-language
+
–
1
votes
1
answer
562
Answer given as (C). Can't understand why ??
Payal Rastogi
386
views
Payal Rastogi
asked
Jan 19, 2016
Theory of Computation
context-free-language
context-sensitive
theory-of-computation
+
–
1
votes
1
answer
563
Which of the following is true ??
Payal Rastogi
353
views
Payal Rastogi
asked
Jan 19, 2016
Theory of Computation
test-series
theory-of-computation
context-free-language
+
–
2
votes
1
answer
564
CFL production
Are grammars with $S \to SS$ productions always ambiguous? Also, how can the production be represented in form of a formula? For example, $S \to aSb \mid \varepsilon$ can be written as $S = a^n b^n$ What would be the formula for $S \to aSb \mid SS \mid \varepsilon$?
Are grammars with $S \to SS$ productions always ambiguous?Also, how can the production be represented in form of a formula? For example, $S \to aSb \mid \varepsilon$ can ...
Abhishekcs10
465
views
Abhishekcs10
asked
Jan 13, 2016
Theory of Computation
context-free-language
+
–
3
votes
1
answer
565
Complement of a recursive language
Given a TM M, complement of L(M) is context-free. True/False?
Given a TM M, complement of L(M) is context-free. True/False?
Arjun
4.0k
views
Arjun
asked
Jan 9, 2016
Theory of Computation
recursive-and-recursively-enumerable-languages
context-free-language
+
–
1
votes
1
answer
566
Regular - CFG
Consider the language L1 = { apbqcr / p,q,r >= 0} and L2 = { apbqcr ​/ p,q,r >= 0 and p=r} Then L1 - L2 is regular of CFL ?
Consider the language L1 = { apbqcr / p,q,r >= 0} and L2 = { apbqcr ​/ p,q,r >= 0 and p=r} Then L1 - L2 is regular of CFL ?
Mojo-Jojo
622
views
Mojo-Jojo
asked
Jan 4, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
5
votes
2
answers
567
Complement of CSL
Please some one explain. why complement of this language is CFL.
Please some one explain. why complement of this language is CFL.
Pradip Nichite
4.8k
views
Pradip Nichite
asked
Dec 31, 2015
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
2
votes
2
answers
568
Is $ a terminal or not ?
Follow(S) comes as {(, ). $ } So, do we count $ ... is also marker to identify that parsing of string has been successfully completed.
Follow(S) comes as {(, ). $ }So, do we count $ as terminal or not.Could anyone please tell me, $ should be considered as terminal or not ? Although I think, I should not...
Sandeep Singh
439
views
Sandeep Singh
asked
Dec 30, 2015
Compiler Design
compiler-design
context-free-language
parsing
+
–
3
votes
2
answers
569
CFL or CSL ?
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
kanahanin
1.7k
views
kanahanin
asked
Dec 8, 2015
Theory of Computation
theory-of-computation
context-free-language
context-sensitive-languages
+
–
5
votes
4
answers
570
PDA
Consider the following push down automata. The language accepted by above PDA is_______. Regular but infinite. DCFL but not regular. CFL but not DCFL Finite language.
Consider the following push down automata.The language accepted by above PDA is_______.Regular but infinite.DCFL but not regular.CFL but not DCFLFinite language.
resuscitate
2.4k
views
resuscitate
asked
Dec 5, 2015
Theory of Computation
theory-of-computation
context-free-language
pushdown-automata
+
–
Page:
« prev
1
...
14
15
16
17
18
19
20
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register