Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-sensitive
3
votes
0
answers
31
GATE CSE 1990 | Question: 15b
Complete the following production rules which generate the language:$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$ where variables $R$ and $Q$ ... $Q \rightarrow R'c$ $cR' \rightarrow ...$ $bR' \rightarrow ...$ $aR' \rightarrow a...$
Complete the following production rules which generate the language:$$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$$ where variables $R$ and $Q$ are used t...
makhdoom ghaya
692
views
makhdoom ghaya
asked
Nov 26, 2016
Theory of Computation
gate1990
descriptive
theory-of-computation
grammar
context-sensitive
out-of-gate-syllabus
+
–
2
votes
1
answer
32
Why can't linear bounded automata accept an empty string?
The linear bounded automata (LBA) is defined as follows: A linear bounded automata is a nondeterministic Turing machine $M=(Q,\Sigma,\Gamma,\delta,q_0,\square,F)$ (as in the definition of TM) with the restriction that ... explains why LBA cannot accept empty string (which is why CSG does not have lambda production). Can anyone explain?
The linear bounded automata (LBA) is defined as follows:A linear bounded automata is a nondeterministic Turing machine $M=(Q,\Sigma,\Gamma,\delta,q_0,\square,F)$ (as in t...
Mahesha999
1.5k
views
Mahesha999
asked
Nov 20, 2016
Theory of Computation
theory-of-computation
context-sensitive
+
–
1
votes
1
answer
33
gate 2005
In a context-sensitive grammar, (a) ε can't be the right-hand side of any production (b) number of grammar symbols on the left-hand side of a production can't be greater than the number of non-terminals on the right-hand side (c) number of grammar symbols on ... a production can't be greater than the number of grammar symbols on the right-hand side (d) all of the above a option is false
In a context-sensitive grammar,(a) ε can’t be the right-hand side of any production(b) number of grammar symbols on the left-hand side of a productioncan’t be greate...
RISHI GUPTA 1
2.7k
views
RISHI GUPTA 1
asked
Nov 14, 2016
Compiler Design
compiler-design
context-sensitive
parsing
+
–
3
votes
1
answer
34
Complement CSL
Rahul Jain25
1.7k
views
Rahul Jain25
asked
Oct 9, 2016
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
5
votes
1
answer
35
TOC
Prerna Chauhan
1.5k
views
Prerna Chauhan
asked
Sep 16, 2016
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
2
votes
2
answers
36
UGC NET CSE | December 2015 | Part 3 | Question: 22
The family of context sensitive languages is _____ under union and ____ under reversal closed, not closed not closed, not closed closed, closed not closed, closed
The family of context sensitive languages is _____ under union and ____ under reversalclosed, not closednot closed, not closedclosed, closednot closed, closed
go_editor
2.1k
views
go_editor
asked
Aug 9, 2016
Theory of Computation
ugcnetcse-dec2015-paper3
theory-of-computation
closure-property
context-sensitive
+
–
2
votes
4
answers
37
grammer in compiler design
Which of the following is the most general phase-structured grammar? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following is the most general phase-structured grammar?(a) regular (b) context-free(c) context-sensitive (d) none of the above
vkm07
1.6k
views
vkm07
asked
Jul 31, 2016
Compiler Design
compiler-design
context-free-grammar
regular-grammar
context-sensitive
+
–
4
votes
2
answers
38
grammer in compiler design
Which of the following grammars are not phase-structured? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following grammars are not phase-structured?(a) regular (b) context-free(c) context-sensitive (d) none of the above
vkm07
5.6k
views
vkm07
asked
Jul 28, 2016
Compiler Design
compiler-design
context-free-grammar
regular-grammar
context-sensitive
+
–
1
votes
1
answer
39
CMI2011-A-09
You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD, USB drives, . . . ). Which of the following is the most accurate formal model of your laptop? Turing machine Linear bounded automaton Pushdown automaton Finite state automaton
You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD, USB drives, . . . ). Which of the following is the most...
go_editor
1.1k
views
go_editor
asked
May 19, 2016
Theory of Computation
cmi2011
theory-of-computation
context-sensitive
non-gate
+
–
1
votes
1
answer
40
Answer given as (C). Can't understand why ??
Payal Rastogi
385
views
Payal Rastogi
asked
Jan 19, 2016
Theory of Computation
context-free-language
context-sensitive
theory-of-computation
+
–
5
votes
2
answers
41
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
+
–
3
votes
0
answers
42
What should be answers of Question 14, 15 and 16 and Why ??
Common Data for Q14,15 &16 is given below: Ram takes two context-free languages $L_1$ and $L_2$ a). He concatenates $L_1 $ and $L_2$ to obtain a new set $L_3$. b). He takes the complement of $L_3$ to obtain a set $L_4$ c). ... is a). recursive b). csl that is not finite c). cfl that may regular d). r.e. set that is never finite.
Common Data for Q14,15 &16 is given below: Ram takes two context-free languages $L_1$ and $L_2$ a). He concatenates $L_1 $ and $L_2$ to obtain a new set $L_3$.b). He take...
Payal Rastogi
578
views
Payal Rastogi
asked
Nov 2, 2015
Theory of Computation
theory-of-computation
regular-language
context-free-language
context-sensitive
+
–
8
votes
3
answers
43
How is the complement of Language L is Context free ??
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular (b) context free (c) context sensitive but not context free (d) recursive and not a cfl.
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular(b) context free(c) context sensitive but not context free(d) recursi...
Payal Rastogi
7.1k
views
Payal Rastogi
asked
Nov 2, 2015
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
1
votes
1
answer
44
plz answer...
Hcas Hgnis
318
views
Hcas Hgnis
asked
Dec 7, 2014
Theory of Computation
theory-of-computation
grammar
context-sensitive
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register