Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1996+decidability
29
votes
2
answers
1
GATE CSE 1996 | Question: 1.9
Which of the following statements is false? The Halting Problem of Turing machines is undecidable Determining whether a context-free grammar is ambiguous is undecidable Given two arbitrary context-free grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$ Given two regular grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$
Which of the following statements is false?The Halting Problem of Turing machines is undecidableDetermining whether a context-free grammar is ambiguous is undecidableGive...
Kathleen
8.1k
views
Kathleen
asked
Oct 9, 2014
Theory of Computation
gate1996
theory-of-computation
decidability
easy
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
