Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by asterixbachman
0
votes
1
question
Which of the following statements is/are true about the automata? (i) DFA is more efficient but less powerful than NFA (ii) DPDA is more powerful but less efficient than NPDA (iii) DTM is more efficient but less powerful than NTM (a) (i), (ii) & (iii) (b) Only (i) & (ii) (c) Only (ii) & (iii) (d) Only (i) & (iii)
Which of the following statements is/are true about the automata?(i) DFA is more efficient but less powerful than NFA(ii) DPDA is more powerful but less efficient than NP...
8.5k
views
answered
Jan 20, 2017
0
votes
2
Self doubt
Can we say Recursive languages are Turing Recognizable? As they are decidable, so they are recognisable also.
Can we say Recursive languages are Turing Recognizable?As they are decidable, so they are recognisable also.
357
views
answered
Jan 20, 2017
Theory of Computation
decidability
theory-of-computation
+
–
1
votes
3
Interesting Problem of TOC Test Series
Which of following Is closed under Homomorphism? A. Computable Enumerable Language B. Decidable Language C. DCFL D. CSL Explain Neatly.
Which of following Is closed under Homomorphism?A. Computable Enumerable LanguageB. Decidable LanguageC. DCFLD. CSL Explain Neatly.
299
views
answered
Jan 20, 2017
Theory of Computation
theory-of-computation
test-series
+
–
0
votes
4
COMPLEMENT OF CSL
1.0k
views
answered
Jan 17, 2017
0
votes
5
Doubt in GateCse Decidability Blog
In the deciadability chart mentioned on http://gatecse.in/grammar-decidable-and-undecidable-problems/ The undecidable problems mentioned here are semidecidable(RE but not REC) not NOT RE.Or there is no such relation? Can someone have a look and tell please?
In the deciadability chart mentioned on http://gatecse.in/grammar-decidable-and-undecidable-problems/The undecidable problems mentioned here are semidecidable(RE but not ...
755
views
answered
Jan 15, 2017
Theory of Computation
decidability
theory-of-computation
recursive-and-recursively-enumerable-languages
turing-machine
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register