The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Michael Sipser Edition 3 Exercise 2 Question 51 (Page No. 159)
0
votes
3
views
Show that every DCFG is an unambiguous CFG.
michael-sipser
theory-of-computation
context-free-grammars
ambiguous
proof
asked
Oct 13
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
3
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
Michael Sipser Edition 3 Exercise 2 Question 46 (Page No. 158)
Consider the following CFG $G:$ $S \rightarrow SS \mid T$ $T \rightarrow aT b \mid ab$ Describe $L(G)$ and show that $G$ is ambiguous. Give an unambiguous grammar $H$ where $L(H) = L(G)$ and sketch a proof that $H$ is unambiguous.
asked
Oct 12
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
6
views
michael-sipser
theory-of-computation
context-free-grammars
ambiguous
proof
0
votes
0
answers
2
Michael Sipser Edition 3 Exercise 2 Question 52 (Page No. 159)
Show that every DCFG generates a prefix-free language.
asked
Oct 13
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
5
views
michael-sipser
theory-of-computation
context-free-grammars
prefix-free-language
proof
0
votes
0
answers
3
Michael Sipser Edition 3 Exercise 5 Question 2 (Page No. 239)
Show that $EQ_{CFG}$ is co-Turing-recognizable.
asked
Oct 17
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
10
views
michael-sipser
theory-of-computation
context-free-grammars
turing-recognizable-languages
proof
+1
vote
1
answer
4
Michael Sipser Edition 3 Exercise 2 Question 26 (Page No. 157)
Show that if $G$ is a $CFG$ in Chomsky normal form$,$ then for any string $w\in L(G)$ of length $n\geq 1,$ exactly $2n − 1$ steps are required for any derivation of $w.$
asked
May 4
in
Theory of Computation
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
26
views
michael-sipser
theory-of-computation
context-free-grammars
cnf
proof
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
REGARDING ISRO TEST SERIES BY MADEESASY
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.3k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.5k
Others
1.5k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 3-4 days but for most purpose you can...
50,647
questions
56,459
answers
195,378
comments
100,276
users