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
srestha
asked
in
Theory of Computation
Oct 12, 2018
128
views
0
votes
0
votes
A turing machine $\left \langle M,w,i \right \rangle$ where $M$ is TM , $w$ is string and $i$ is bit.
Is the bit $i$ is encoding at last of the string $w$ or at first?
turing-machine
theory-of-computation
srestha
asked
in
Theory of Computation
Oct 12, 2018
by
srestha
128
views
answer
comment
Follow
share this
share
0 Comments
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
2
answers
1
h4kr
asked
in
Theory of Computation
Dec 7, 2022
133
views
Turing machine question
I saw question where I saw this format being used: L1 = {<M> | L(M) = ϕ} What does exactly <M> mean and why is L(M) = ϕ, mentioned afterwards. Isn’t L() stands for language for something? If the language is equivalent to null, it contains nothing. Then what does it exactly mean?
h4kr
asked
in
Theory of Computation
Dec 7, 2022
by
h4kr
133
views
theory-of-computation
turing-machine
test-series
3
votes
3
votes
1
answer
2
hitesh159
asked
in
Theory of Computation
May 28, 2019
560
views
ace academy test series toc turing machine
hitesh159
asked
in
Theory of Computation
May 28, 2019
by
hitesh159
560
views
theory-of-computation
turing-machine
ace-test-series
3
votes
3
votes
2
answers
3
srestha
asked
in
Theory of Computation
Apr 30, 2019
819
views
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
srestha
asked
in
Theory of Computation
Apr 30, 2019
by
srestha
819
views
theory-of-computation
turing-machine
test-series
0
votes
0
votes
0
answers
4
srestha
asked
in
Theory of Computation
Apr 13, 2019
214
views
Self doubt- Turing machine
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Which one REC? How to compute the different length string?
srestha
asked
in
Theory of Computation
Apr 13, 2019
by
srestha
214
views
turing-machine
theory-of-computation
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 GATE to Australia
DRDO Previous Year Papers
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
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
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
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
That was my second attempt. I already had notes,...
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...
I see no inspiration here. Not everyone is...
Yaa toa intentionally bohot jyada sahi time kiya...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
