Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for turing-machine
91
votes
5
answers
1
GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$. Let $$L=\left\{\langle M \rangle \mid M \text{ is a Turing machi...
go_editor
27.8k
views
go_editor
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set2
theory-of-computation
turing-machine
normal
+
–
70
votes
4
answers
2
GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...
Arjun
24.1k
views
Arjun
asked
Sep 8, 2014
Theory of Computation
theory-of-computation
turing-machine
gatecse-2003
difficult
+
–
12
votes
2
answers
3
GATE CSE 2022 | Question: 36
Which of the following is/are undecidable? Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$ Given a Turing machine $\textit{M},$ decide if $\textit{L(M)}$ is ... $\textit{M},$ decide if $\textit{M}$ takes more than $1073$ steps on every string.
Which of the following is/are undecidable?Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$Given a Turin...
Arjun
10.0k
views
Arjun
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
turing-machine
decidability
multiple-selects
2-marks
+
–
0
votes
0
answers
4
Theory of Computation | design of Turing Machine
Is this the correct Turing machine for the language $0^n 1^n0^n$? assuming $ at the end and begining of the input tape
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
RahulVerma3
46
views
RahulVerma3
asked
Apr 2
Theory of Computation
theory-of-computation
turing-machine
+
–
5
votes
1
answer
5
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 64
Which of the following languages are Turing-recognizable? A. $\{\langle M\rangle \mid M$ is a (deterministic) Turing machine and $M$ accepts 010$\}$. B. $\{\langle M\rangle \mid M$ is a nondeterministic Turing machine and $M$ accepts 010 ... $\left\{\langle M\rangle \mid M\right.$ is a Turing machine and $\left.L(M)=\Sigma^*\right\}$.
Which of the following languages are Turing-recognizable?A. $\{\langle M\rangle \mid M$ is a (deterministic) Turing machine and $M$ accepts 010$\}$.B. $\{\langle M\rangle...
GO Classes
500
views
GO Classes
asked
Feb 5
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
turing-machine
multiple-selects
2-marks
+
–
5
votes
1
answer
6
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 55
Recall that a Turing machine $\text{T}$ can be represented or 'coded' by an integer $m$. Let us write 'the $m$ th Turing machine' to mean the Turing machine coded by $m$. Which of the following sets is not ... machine halts on the input $m$. The set of $n$ such that all Turing machines halt on the input $n$.
Recall that a Turing machine $\text{T}$ can be represented or 'coded' by an integer $m$. Let us write 'the $m$ th Turing machine' to mean the Turing machine coded by $m$....
GO Classes
492
views
GO Classes
asked
Jan 28
Theory of Computation
goclasses2024-mockgate-13
goclasses
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
2-marks
+
–
4
votes
1
answer
7
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 64
Which of the following statements about Turing machines is false? For every context-sensitive language $L$, there is a Turing machine that accepts precisely the strings of $L$. For any grammar $G$ ... Turing machine $A$ which can simulate the behaviour of any given Turing machine $B$ on any given finite input.
Which of the following statements about Turing machines is false?For every context-sensitive language $L$, there is a Turing machine that accepts precisely the strings of...
GO Classes
533
views
GO Classes
asked
Jan 13
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
turing-machine
multiple-selects
2-marks
+
–
0
votes
0
answers
8
Hopcroft, Ullman Theorem 9.7 Reductions
There exists a language Ld = {M | M doesn't belong to L(M)}. Ld is the collection of Turing machines (programs) M such that M does not halt and accept when given itself as input. It is known and proved that Ld is a non- ... and Ld is non-RE, ATM must be non-RE. But we know that ATM is Recursively Enumerable and undecidable. How is this possible?
There exists a language Ld = {M | M doesn't belong to L(M)}. Ld is the collection of Turing machines (programs) M such that M does not halt and accept when given itself a...
dopq12
90
views
dopq12
asked
Mar 5
Theory of Computation
decidability
theory-of-computation
turing-machine
reduction
recursive-and-recursively-enumerable-languages
+
–
1
votes
0
answers
9
Decidability
L(M)={0} We can have Tyes for {0} and Tno for Σ∗ ({0}⊂Σ∗{0}⊂Σ∗). Hence, L={M ∣ L(M)={0}} is not Turing recognizable (not recursively enumerable) I don’t understand why this is not decidable. We can easily create a turing that accepts this language
L(M)={0}We can have Tyes for {0} and Tno for Σ∗ ({0}⊂Σ∗{0}⊂Σ∗). Hence, L={M ∣ L(M)={0}} is not Turing recognizable (not recursively enumerable)I don’t ...
amitarp818
238
views
amitarp818
asked
Dec 28, 2023
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
3
votes
2
answers
10
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
360
views
Jiten008
asked
Oct 24, 2023
Theory of Computation
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
+
–
0
votes
0
answers
11
Turing machine for a^n b^m c^n d^m NET UGC December 2022
The state diagram for the initial part of this turing machine given as: Here, we are basically traversing through the input tape, changing occurence of 'a' to X1, and 'c' to X2. After that we go back in ... it wrong by skipping one state and directly looping back to 'q0' Please shed some light on it, thanks!
The state diagram for the initial part of this turing machine given as:Here, we are basically traversing through the input tape, changing occurence of 'a' to X1, and 'c' ...
Picturesque
247
views
Picturesque
asked
Oct 31, 2023
Theory of Computation
theory-of-computation
turing-machine
+
–
0
votes
0
answers
12
Design Turing machines to compute the following functions for x and y positive integers represented in unary. (a) f(x) = 3x
sridharsiddi
785
views
sridharsiddi
asked
Apr 16, 2023
Theory of Computation
theory-of-computation
turing-machine
+
–
32
votes
3
answers
13
GATE CSE 2001 | Question: 7
Let a decision problem $X$ be defined as follows: $X$: Given a Turing machine $M$ over $\Sigma$ and any word $w \in \Sigma$, does $M$ loop forever on $w$? You may assume that the halting problem of Turing machine is undecidable but partially decidable. Show that $X$ is undecidable Show that $X$ is not even partially decidable
Let a decision problem $X$ be defined as follows:$X$: Given a Turing machine $M$ over $\Sigma$ and any word $w \in \Sigma$, does $M$ loop forever on $w$?You may assume th...
Kathleen
4.6k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
decidability
turing-machine
easy
descriptive
+
–
0
votes
0
answers
14
Peter Linz Edition 5 Exercise 10.5 Question 3
Consider an offline Turing machine in which the input can be read only once, moving left to right, and not rewritten. On its work tape, it can use at most n extra cells for work space, where n is fixed for all inputs. Show that such a machine is equivalent to a finite automaton.
Consider an offline Turing machine in which the input can be read only once, moving left to right, and not rewritten. On its work tape, it can use at most n extra cells f...
borhanElmi
317
views
borhanElmi
asked
Feb 8, 2023
Theory of Computation
theory-of-computation
peter-linz-edition5
turing-machine
+
–
52
votes
3
answers
15
GATE CSE 2004 | Question: 89
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another language $L_2$ over $\Sigma \cup \left\{\text{#}\right\}$ ... $S_1$ is true but $S_2$ is not necessarily true $S_2$ is true but $S_1$ is not necessarily true Neither is necessarily true
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another lang...
Kathleen
11.0k
views
Kathleen
asked
Sep 18, 2014
Theory of Computation
gatecse-2004
theory-of-computation
turing-machine
difficult
+
–
3
votes
2
answers
16
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?
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 langua...
h4kr
724
views
h4kr
asked
Dec 7, 2022
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
2
votes
0
answers
17
DRDO CSE 2022 Paper 2 | Question: 13
Let $L$ be the following language. $L=\left\{P\left(x_{1}, x_{2}, \ldots, x_{n}\right) \mid P\right.$ is a polynomial with an integral root $\}$. Explain why the following Turing Machine description cannot decide the language $L$. ... $0,$ accept. Else, reject.
Let $L$ be the following language.$L=\left\{P\left(x_{1}, x_{2}, \ldots, x_{n}\right) \mid P\right.$ is a polynomial with an integral root $\}$.Explain why the following ...
admin
244
views
admin
asked
Dec 15, 2022
Theory of Computation
drdocse-2022-paper2
theory-of-computation
decidability
turing-machine
4-marks
+
–
1
votes
0
answers
18
DRDO CSE 2022 Paper 2 | Question: 12 (c)
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turing machine for the following languages. $L_{1} \cap L_{2}$
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turi...
admin
268
views
admin
asked
Dec 15, 2022
Theory of Computation
drdocse-2022-paper2
theory-of-computation
decidability
turing-machine
2-marks
descriptive
+
–
1
votes
0
answers
19
DRDO CSE 2022 Paper 2 | Question: 12 (a)
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turing machine for the following languages. $L_{1} \cup L_{2}$
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turi...
admin
293
views
admin
asked
Dec 15, 2022
Theory of Computation
drdocse-2022-paper2
theory-of-computation
decidability
turing-machine
2-marks
descriptive
+
–
1
votes
0
answers
20
DRDO CSE 2022 Paper 2 | Question: 12 (b)
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turing machine for the following languages. $L=\left\{a \circ b \mid a \in L_{1}, b \in L_{2}\right\}$ where $a$ o $b$ denotes the concatenation of the strings $a$ and $b$
Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turi...
admin
191
views
admin
asked
Dec 15, 2022
Theory of Computation
drdocse-2022-paper2
theory-of-computation
decidability
turing-machine
2-marks
descriptive
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register