The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Nit9
User Nit9
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Nit9
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
toc decidability
CS4820 Spring 2013 Notes on Turing Machines 19/26 (e) ever moves its head more than 481 tape cells away from the left endmarker on input ε ? (f) accepts the null string ε ? (g) accepts any string at all?(h) accepts every string?(i) accepts a ﬁnite set?(j) accepts a recursive set? (k) is equivalent to a Turing machine with a shorter description???
asked
Dec 2, 2017
in
Theory of Computation

47
views
0
votes
0
answers
2
effective enumeration of (0+1)*
help, my workbook says its not possible becoz its infinite but isnt its countable infinite?! can't we use proper order if we use increasing length of sequences?
asked
Dec 6, 2016
in
Theory of Computation

40
views
0
votes
1
answer
3
acceptance of a^n b^m c^n ; n>1, m≥0
is it possible with deterministic PDA?
asked
Dec 4, 2016
in
Theory of Computation

407
views
+1
vote
2
answers
4
a turing machine computes the product of two numbers,? decidable or undecidable
for 1. given any two specific numbers 2. any two arbitrary numbers
asked
Dec 3, 2016
in
Theory of Computation

1.1k
views
theoryofcomputation
turingmachine
+1
vote
2
answers
5
The proposition {[p → (q ∨ r)] ∧ (~q)} → (p → r) is
The proposition {[p → (q ∨ r)] ∧ (~q)} → (p → r) is
asked
Feb 2, 2016
in
Mathematical Logic

1k
views
mathematicallogic
virtualgatetestseries
50,737
questions
57,384
answers
198,538
comments
105,331
users