The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
15
views
Show that every DCFG is an unambiguous CFG.
michael-sipser
theory-of-computation
context-free-grammars
ambiguous
proof
asked
Oct 13, 2019
in
Theory of Computation
by
Lakshman Patel RJIT
|
15
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
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 13, 2019
in
Theory of Computation
by
Lakshman Patel RJIT
|
48
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, 2019
in
Theory of Computation
by
Lakshman Patel RJIT
|
14
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 18, 2019
in
Theory of Computation
by
Lakshman Patel RJIT
|
23
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, 2019
in
Theory of Computation
by
Lakshman Patel RJIT
|
38
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
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA) - Interview Experience
Interview Experience for MS(R)-IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
@commenter max marks for part A was 75. They did...
Hope you get selected bhaiya
Can someone tell me how to check part B marks?...
After getting so many mails from you...
Refund will be given for such cases if applied...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,501
answers
201,871
comments
95,325
users
