1
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}$$
2
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 65 English
3
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Which of the following regular expression identities are true?
A
$$r\left( {^ * } \right) = r{}^ * $$
B
$$\left( {r{}^ * s{}^ * } \right){}^ * = \left( {r + s} \right){}^ * $$
C
$$\,\left( {r + s} \right){}^ * = r{}^ * + s{}^ * $$
D
$$r{}^ * s{}^ * = r{}^ * + s{}^ * $$
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
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12