1
GATE CSE 1989
Subjective
+2
-0
How many substrings (of all lengths inclusive ) can be formed from a character string of length $$n$$? Assume all characters to be distinct. Prove your answer.
2
GATE CSE 1989
Subjective
+5
-0
Is the class of regular sets closed under infinite union? Explain.
3
GATE CSE 1989
MCQ (More than One Correct Answer)
+2
-0.6
Context free languages and regular languages are both closed under the operation(s) of :
A
Union
B
Intersection
C
Concatenation
D
Complementation
4
GATE CSE 1989
MCQ (More than One Correct Answer)
+2
-0.6
Which of the following problems are un-decidable?
A
Membership problem in context - free languages.
B
Whether a given context - free language is regular.
C
Whether a finite state automation halts on all inputs.
D
Membership problem for type $$0$$ languages.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12