1
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 58 English
2
GATE CSE 1994
Subjective
+5
-0
Given that language $${L_1}$$ is regular and that the language $${L_1} \cap {L_2}$$ is regular is the language $${L_2}$$ is always regular?
3
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Which of the following features cannot be captured by context-free grammars?
A
Syntax of if-then-else statements
B
Syntax of recursive procedures
C
Whether a variable has been declared before its use
D
Variable names of arbitrary length
4
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Which of the following conversions is not possible (algorithmically)?
A
Regular grammar to context free grammar
B
Non-deterministic $$FSA$$ to deterministic $$FSA$$
C
Non-deterministic $$PDA$$ to deterministic $$PDA$$
D
Non-deterministic Turing machine to deterministic Turing machine
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CET
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN