1
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
Which of the following definitions below generates the same language as $$L$$
Where $$L = {\left\{ x \right.^n}{y^n}\left| {n \ge \left. 1 \right\}} \right.$$
i) $$\,\,E \to xEy\left| {xy} \right.$$
ii) $$\,\,xy\left| {\left( {{x^ + }xy{y^ + }} \right)} \right.$$
iii) $${\,\,{x^ + }{y^ + }}$$
$$L = \left\{ {xn\,{y^n}\left| {n \ge 1} \right.} \right\} - $$ generates string where equal no. of $$x$$ and equal no. of $$y's.$$
$$E \to XBy\left| {xy\,abo} \right.$$ generators tips same.
A
(i) only
B
(i) and (ii)
C
(ii) and (iii)
D
(ii) only
2
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is
A
$$n$$
B
$${n^2}$$
C
$${{n\left( {n - 1} \right)} \over 2}$$
D
$${{n\left( {n + 1} \right)} \over 2}$$
3
GATE CSE 1994
Fill in the Blanks
+2
-0
The regular expression for the language recognized by the finite state automation of is _________. GATE CSE 1994 Theory of Computation - Finite Automata and Regular Language Question 81 English
4
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
If $$G$$ is a context-free grammar and $$w$$ is a string of length $$n$$ in $$L(G),$$ how long is a derivation of $$w$$ in $$G,$$ if $$G$$ is Chomsky normal form?
A
$$2n$$
B
$$2n+1$$
C
$$2n-1$$
D
$$n$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP