Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Ravi8770071203
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ravi8770071203
4
answers
1
GATE CSE 2016 Set 1 | Question: 17
Which of the following decision problems are undecidable? Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$ Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in \Sigma^{*}$, does $x \in L(G)$} ? Given CFGs $G_1$ and $G_2$, is $L (G_1) = L(G_2)$? Given a TM $M$, is $L(M)=\Phi$ ? I and IV only II and III only III and IV only II and IV only
Which of the following decision problems are undecidable?Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in ...
8.5k
views
commented
Sep 11, 2021
Theory of Computation
gatecse-2016-set1
theory-of-computation
decidability
easy
+
–
4
answers
2
GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1 ($over alphabet $0)$ accepted by the following automaton. The order of $L_1$ is ________.
Given a language $L$, define $L^i$ as follows:$$L^0 = \{ \varepsilon \}$$$$L^i = L^{i-1} \bullet L \text{ for all } I >0$$The order of a language $L$ is defined as the s...
20.5k
views
commented
Sep 9, 2021
Theory of Computation
gatecse-2018
theory-of-computation
numerical-answers
regular-language
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register