Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged turingmachine
+1
vote
0
answers
Turing Machine
As per the definition of a Turing Machine, it does not accept Epsilon. But, A → ϵ can be generated by a Unrestricted Grammar. So, how can we say that Turing Machines are the acceptors for Recursively Enumerable languages generated by Unrestricted Grammar?
asked
Feb 13
in
Theory of Computation
by
Joon88
(
7
points)

14
views
#toc
turingmachine
theoryofcomputation
grammar
unrestrictedgrammar
0
votes
0
answers
undecidability pdf given on gatecse rice's theorem
asked
Jan 31
in
Theory of Computation
by
shethnisarg
(
6
points)

10
views
recursiveenumurablelanguage
#ricestheorem
theoryofcomputation
turingmachine
0
votes
0
answers
GATE GURU: TURING MACHINES
asked
Jan 22
in
Theory of Computation
by
Debapaul
(
698
points)

35
views
turingmachine
0
votes
0
answers
Self Doubts #Decidablity
I am looking the explanation of the below mentioned being decidable / Undecidable. (Given : Defination of TM in binary) Turing machine's control head move left/ right once, for a given input . Turing machine's control head move left/ right any ... answer vary from 2nd point ?) Turing machine replaces at least one character / exactly k (finite) characters in the input.
asked
Jan 20
in
Theory of Computation
by
dr_Jackal
(
16
points)

6
views
decidability
automata
turingmachine
0
votes
0
answers
Self Doubt: Turing Machine
Whether a Turing Machine accepts an $EMPTY$ $LANGUAGE$ is $decidable$ or $undecidable?$
asked
Dec 31, 2019
in
Theory of Computation
by
Debapaul
(
698
points)

28
views
turingmachine
0
votes
0
answers
Decidability Self Doubt
L={<M>L(M) is finite} undecidable. $L=\left \{ L\left ( M \right ) L\left (M\right )=\Sigma ^{*} \right \}$undecidable L={<M>L(M) is recursive} undecidable. L={<M>L(M) is PROPER subset of $\Sigma ^{*}$} undecidable [while, L={<M>L(M) is subset of $\Sigma ^{*}$} decidable ] How these four conclusion is correct? Plz. explain
asked
Nov 13, 2019
in
Theory of Computation
by
srestha
(
679
points)

36
views
turingmachine
0
votes
1
answer
Self doubt Turing machines
What does the encoding <M,w,i> actually means in question of Turing machines, can anyone explain clearly ?
asked
Nov 10, 2019
in
Theory of Computation
by
Winner
(
73
points)

7
views
turingmachine
0
votes
0
answers
Whether a TM accepts a Recursively enumarable language. Decidable or not ?
asked
Sep 14, 2019
in
Theory of Computation
by
Amal
(
29
points)

74
views
decidability
turingmachine
recursively
0
votes
3
answers
Self Doubt on Decidability
Is it decidable that a Turing Machine will ever leave the start state on any input?
asked
Sep 11, 2019
in
Theory of Computation
by
Sukhbir Singh
(
8
points)

41
views
turingmachine
decidability
0
votes
1
answer
Self Doubt: Turing machine Decidability
Whether a Turing machine will halt within 100 steps decidable or undecidable?
asked
Aug 30, 2019
in
Theory of Computation
by
GAITONDE
(
1.7k
points)

25
views
turingmachine
0
votes
1
answer
Self doubtTuring machine
Every recursive language is Recursively enumerable, so can we say that : Recursive languages are Turing Recognizable
asked
Aug 26, 2019
in
Theory of Computation
by
Kushagra गुप्ता
(
176
points)

35
views
turingmachine
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Feb 2020
shashin
363 Points
Shaik Masthan
79 Points
SuvasishDutta
39 Points
srestha
33 Points
Mk Utkarsh
32 Points
neeraj_bhatt
31 Points
!KARAN
30 Points
Debapaul
23 Points
Pratyush Priyam Kuan
18 Points
kalra05
18 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,331
questions
1,581
answers
10,281
comments
89,916
users