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
Recent questions tagged proof
0
votes
0
answers
31
Michael Sipser Edition 3 Exercise 5 Question 9 (Page No. 239)
Let $T = \{\langle M \rangle \mid \text{M is a TM that accepts $w^{R}$ whenever it accepts} \:w\}$. Show that $T$ is undecidable.
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
209
views
michael-sipser
theory-of-computation
turing-machine
decidability
proof
0
votes
0
answers
32
Michael Sipser Edition 3 Exercise 5 Question 8 (Page No. 239)
In the proof of Theorem $5.15$, we modified the Turing machine $M$ so that it never tries to move its head off the left-hand end of the tape. Suppose that we did not make this modification to $M$. Modify the $PCP$ construction to handle this case.
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
314
views
michael-sipser
theory-of-computation
turing-machine
post-correspondence-problem
proof
0
votes
0
answers
33
Michael Sipser Edition 3 Exercise 5 Question 7 (Page No. 239)
Show that if $A$ is Turing-recognizable and $A\leq_{m} \overline{A},$ then $A$ is decidable.
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
241
views
michael-sipser
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
reduction
proof
0
votes
0
answers
34
Michael Sipser Edition 3 Exercise 5 Question 6 (Page No. 239)
Show that $\leq_{m}$ is a transitive relation.
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
169
views
michael-sipser
theory-of-computation
turing-machine
reduction
proof
0
votes
0
answers
35
Michael Sipser Edition 3 Exercise 5 Question 5 (Page No. 239)
Show that $A_{TM}$ is not mapping reducible to $E_{TM}$. In other words, show that no computable function reduces $A_{TM}$ to $E_{TM}$. (Hint: Use a proof by contradiction, and facts you already know about $A_{TM}$ and $E_{TM}$.)
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
181
views
michael-sipser
theory-of-computation
turing-machine
reduction
proof
0
votes
0
answers
36
Michael Sipser Edition 3 Exercise 5 Question 4 (Page No. 239)
If $A \leq_{m} B$ and $B$ is a regular language, does that imply that $A$ is a regular language? Why or why not?
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
187
views
michael-sipser
theory-of-computation
regular-language
reduction
proof
0
votes
0
answers
37
Michael Sipser Edition 3 Exercise 5 Question 3 (Page No. 239)
Find a match in the following instance of the Post Correspondence Problem. $\begin{Bmatrix} \bigg[\dfrac{ab}{abab}\bigg],&\bigg[\dfrac{b}{a}\bigg],&\bigg[\dfrac{aba}{b}\bigg], & \bigg[\dfrac{aa}{a}\bigg] \end{Bmatrix}$
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
247
views
michael-sipser
theory-of-computation
turing-machine
post-correspondence-problem
proof
0
votes
0
answers
38
Michael Sipser Edition 3 Exercise 5 Question 2 (Page No. 239)
Show that $EQ_{CFG}$ is co-Turing-recognizable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
178
views
michael-sipser
theory-of-computation
context-free-grammar
recursive-and-recursively-enumerable-languages
proof
0
votes
0
answers
39
Michael Sipser Edition 3 Exercise 5 Question 1 (Page No. 239)
Show that $EQ_{CFG}$ is undecidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
168
views
michael-sipser
theory-of-computation
context-free-grammar
decidability
proof
0
votes
0
answers
40
Michael Sipser Edition 3 Exercise 4 Question 32 (Page No. 213)
The proof of Lemma $2.41$ says that $(q, x)$ is a looping situation for a $DPDA \:P$ if when $P$ is started in state $q$ with $x \in \Gamma$ on the top of the stack, it never pops anything below $x$ and it never reads an input ... decidable, where $F = \{ \langle P, q, x \rangle \mid (q, x)\: \text{is a looping situation for P}\}$.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
305
views
michael-sipser
theory-of-computation
dpda
decidability
proof
1
vote
0
answers
41
Michael Sipser Edition 3 Exercise 4 Question 31 (Page No. 212)
Say that a variable $A$ in $CFL\: G$ is usable if it appears in some derivation of some string $w \in G$. Given a $CFG\: G$ and a variable $A$, consider the problem of testing whether $A$ is usable. Formulate this problem as a language and show that it is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
451
views
michael-sipser
theory-of-computation
context-free-language
context-free-grammar
decidability
proof
0
votes
0
answers
42
Michael Sipser Edition 3 Exercise 4 Question 30 (Page No. 212)
Let $A$ be a Turing-recognizable language consisting of descriptions of Turing machines, $\{ \langle M_{1}\rangle,\langle M_{2}\rangle,\dots\}$, where every $M_{i}$ is a decider. Prove that some decidable language $D$ is not ... $A$. (Hint: You may find it helpful to consider an enumerator for $A$.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
314
views
michael-sipser
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
decidability
proof
0
votes
0
answers
43
Michael Sipser Edition 3 Exercise 4 Question 29 (Page No. 212)
Let $C_{CFG} = \{\langle G, k \rangle \mid \text{ G is a CFG and L(G) contains exactly $k$ strings where $k \geq 0$ or $k = \infty$}\}$. Show that $C_{CFG}$ is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
251
views
michael-sipser
theory-of-computation
context-free-grammar
decidability
proof
0
votes
0
answers
44
Michael Sipser Edition 3 Exercise 4 Question 28 (Page No. 212)
Let $C = \{ \langle G, x \rangle \mid \text{G is a CFG $x$ is a substring of some $y \in L(G)$}\}$. Show that $C$ is decidable. (Hint: An elegant solution to this problem uses the decider for $E_{CFG}$.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
179
views
michael-sipser
theory-of-computation
context-free-grammar
decidability
proof
0
votes
0
answers
45
Michael Sipser Edition 3 Exercise 4 Question 27 (Page No. 212)
Let $E = \{\langle M \rangle \mid \text{ M is a DFA that accepts some string with more 1s than 0s}\}$. Show that $E$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
233
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
0
votes
1
answer
46
Michael Sipser Edition 3 Exercise 4 Question 26 (Page No. 212)
Let $PAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some palindrome}\}$. Show that $PAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
326
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
0
votes
0
answers
47
Michael Sipser Edition 3 Exercise 4 Question 25 (Page No. 212)
Let $BAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some string containing an equal number of 0s and 1s}\}$. Show that $BAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
236
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
0
votes
0
answers
48
Michael Sipser Edition 3 Exercise 4 Question 24 (Page No. 212)
A useless state in a pushdown automaton is never entered on any input string. Consider the problem of determining whether a pushdown automaton has any useless states. Formulate this problem as a language and show that it is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
489
views
michael-sipser
theory-of-computation
pushdown-automata
decidability
proof
0
votes
0
answers
49
Michael Sipser Edition 3 Exercise 4 Question 23 (Page No. 212)
Say that an $NFA$ is ambiguous if it accepts some string along two different computation branches. Let $AMBIG_{NFA} = \{ \langle N \rangle \mid \text{ N is an ambiguous NFA}\}$. Show that $AMBIG_{NFA}$ is decidable. (Suggestion: One elegant way to solve this problem is to construct a suitable $DFA$ and then run $E_{DFA}$ on it.)
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
336
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
0
votes
0
answers
50
Michael Sipser Edition 3 Exercise 4 Question 22 (Page No. 212)
Let $PREFIX-FREE_{REX} = \{\langle R \rangle \mid \text{R is a regular expression and L(R) is prefix-free}\}$. Show that $PREFIX FREE_{REX}$ is decidable. Why does a similar approach fail to show that $PREFIX-FREE_{CFG}$ is decidable?
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
397
views
michael-sipser
theory-of-computation
regular-expression
decidability
proof
0
votes
0
answers
51
Michael Sipser Edition 3 Exercise 4 Question 21 (Page No. 212)
Let $S = \{\langle M \rangle \mid \text{M is a DFA that accepts}\: \text{ $w^{R}$ whenever it accepts $w$}\}$. Show that $S$ is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
123
views
michael-sipser
theory-of-computation
decidability
proof
0
votes
0
answers
52
Michael Sipser Edition 3 Exercise 4 Question 20 (Page No. 212)
Let $A$ and $B$ be two disjoint languages. Say that language $C$ separates $A$ and $B$ if $A \subseteq C$ and $B \subseteq \overline{C}$. Show that any two disjoint co-Turing-recognizable languages are separable by some decidable language.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
295
views
michael-sipser
theory-of-computation
recursive-and-recursively-enumerable-languages
proof
0
votes
0
answers
53
Michael Sipser Edition 3 Exercise 4 Question 19 (Page No. 212)
Prove that the class of decidable languages is not closed under homomorphism.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
124
views
michael-sipser
theory-of-computation
decidability
proof
0
votes
0
answers
54
Michael Sipser Edition 3 Exercise 4 Question 18 (Page No. 212)
Let $C$ be a language. Prove that $C$ is Turing-recognizable iff a decidable language $D$ exists such that $C = \{x \mid \exists y (\langle{ x, y \rangle} \in D)\}$.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
171
views
michael-sipser
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
proof
0
votes
0
answers
55
Michael Sipser Edition 3 Exercise 4 Question 17 (Page No. 212)
Prove that $EQ_{DFA}$ is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
256
views
michael-sipser
theory-of-computation
finite-automata
decidability
proof
0
votes
0
answers
56
Michael Sipser Edition 3 Exercise 4 Question 16 (Page No. 212)
Let $A = \{ \langle R \rangle \mid \text{R is a regular expression describing a language containing at least one string w that has 111 as a substring} \text{(i.e., w = x111y for some x and y)\}}$. Show that $A$ is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
184
views
michael-sipser
theory-of-computation
decidability
proof
0
votes
0
answers
57
Michael Sipser Edition 3 Exercise 4 Question 15 (Page No. 212)
Show that the problem of determining whether a CFG generates all strings in $1^{\ast}$ is decidable. In other words, show that $\{\langle { G \rangle} \mid \text{G is a CFG over {0,1} and } 1^{\ast} \subseteq L(G) \}$ is a decidable language.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
536
views
michael-sipser
theory-of-computation
context-free-grammar
decidability
proof
0
votes
0
answers
58
Michael Sipser Edition 3 Exercise 4 Question 14 (Page No. 211)
Let $\Sigma = \{0,1\}$. Show that the problem of determining whether a $CFG$ generates some string in $1^{\ast}$ is decidable. In other words, show that $\{\langle {G \rangle}\mid \text{G is a CFG over {0,1} and } 1^{\ast} \cap L(G) \neq \phi \}$ is a decidable language.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
191
views
michael-sipser
theory-of-computation
context-free-grammar
decidability
proof
0
votes
0
answers
59
Michael Sipser Edition 3 Exercise 4 Question 13 (Page No. 211)
Let $A = \{ \langle{ R, S \rangle} \mid \text{R and S are regular expressions and} \: L(R) \subseteq L(S)\}$. Show that $A$ is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
123
views
michael-sipser
theory-of-computation
decidability
proof
0
votes
0
answers
60
Michael Sipser Edition 3 Exercise 4 Question 12 (Page No. 211)
Let $A = \{\langle{ M \rangle} \mid \text{M is a DFA that doesn’t accept any string containing an odd number of 1s}\}$.Show that $A$ is decidable.
admin
asked
in
Theory of Computation
Oct 17, 2019
by
admin
146
views
michael-sipser
theory-of-computation
decidability
proof
Page:
« prev
1
2
3
4
5
6
7
...
9
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged proof
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...