Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
turing machine self doubt a+b=c
manisha11
asked
in
Theory of Computation
Apr 27, 2019
156
views
0
votes
0
votes
Turing machine,
language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
theory-of-computation
self-doubt
manisha11
asked
in
Theory of Computation
Apr 27, 2019
by
manisha11
156
views
answer
comment
Follow
share this
share
1 comment
by
srestha
commented
Apr 27, 2019
reply
Follow
share this
what is ur doubt here?
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
♥_Less
asked
in
Theory of Computation
Nov 29, 2017
881
views
Self doubt in terminologies and turing machine
1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies undecidability or not. I got confused with word decidable in " ... same expressive power why can't we use DTM in NP decision problems? Thanks for being patient and reading doubt.
♥_Less
asked
in
Theory of Computation
Nov 29, 2017
by
♥_Less
881
views
theory-of-computation
turing-machine
decidability
self-doubt
p-np-npc-nph
0
votes
0
votes
0
answers
2
Ritabrata Dey
asked
in
Theory of Computation
Mar 26, 2019
189
views
Turing Machine: Self doubt
What is the difference between Turing recognizable language and Turing decidable language? Please someone explain me clearly the concept
Ritabrata Dey
asked
in
Theory of Computation
Mar 26, 2019
by
Ritabrata Dey
189
views
self-doubt
0
votes
0
votes
1
answer
3
Namit Dhupar
asked
in
Theory of Computation
Nov 27, 2017
391
views
Doubt In Turing Machine syllabus, Peter Linz
I am confused, besides LBA! what should i do from these topics from this book?
Namit Dhupar
asked
in
Theory of Computation
Nov 27, 2017
by
Namit Dhupar
391
views
theory-of-computation
turing-machine
self-doubt
peter-linz
1
vote
1
vote
0
answers
4
iarnav
asked
in
Theory of Computation
Oct 17, 2017
545
views
Doubt regarding Turing Machine
I have read that T.M does not accept ε , but then in questions I have read T.M taking input ε ? Well, if T.M can't accept ε then why we are giving T.M the input ε ? Thank you!
iarnav
asked
in
Theory of Computation
Oct 17, 2017
by
iarnav
545
views
theory-of-computation
turing-machine
self-doubt
decidability
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(861)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Pip box does not detect latex code properly. $$...
GO Classes CN Test-4 is here.
@lalitver10 Thank you for your feedback....
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
