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
Questions by Nit9
0
votes
0
answers
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 finite set?(j) accepts a recursive set? (k) is equivalent to a Turing machine with a shorter description???
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 �...
205
views
asked
Dec 2, 2017
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?
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?
162
views
asked
Dec 6, 2016
0
votes
1
answer
3
acceptance of a^n b^m c^n ; n>1, m≥0
is it possible with deterministic PDA?
is it possible with deterministic PDA?
1.3k
views
asked
Dec 4, 2016
2
votes
3
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
for1. given any two specific numbers2. any two arbitrary numbers
3.6k
views
asked
Dec 3, 2016
Theory of Computation
theory-of-computation
turing-machine
+
–
1
votes
2
answers
5
The proposition {[p → (q ∨ r)] ∧ (~q)} → (p → r) is
The proposition {[p → (q ∨ r)] ∧ (~q)} → (p → r) is
The proposition {[p → (q ∨ r)] ∧ (~q)} → (p → r) is
2.4k
views
asked
Feb 2, 2016
Mathematical Logic
mathematical-logic
virtual-gate-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register