menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
IIT Interview Experiences (Patna, Jodhpur and Hyd)
IIT Madras Direct PhD Interview Experience-July 2020
IIT Hyderabad M.Tech RA CSE Interview Experience-July 2020
IIT Hyderabad AI M.tech RA Interview Experience-July 2020
GATE 2021 BROCHURE
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
it'll be automatic.
@gatecse Suppose if someone is the top user of...
Thanks for the clarification.
"Weekly Top User": It is only one person per...
gatecse Even my name is showing in the list of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Peter Linz Edition 5 Exercise 12.2 Question 4 (Page No. 311)
0
votes
35
views
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G)^R$ is recursive enumerable$?$
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
asked
Mar 16, 2019
in
Theory of Computation
Rishi yadav
35
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
28
views
Peter Linz Edition 5 Exercise 12.2 Question 8 (Page No. 311)
For an unrestricted grammar $G$, show that the question $“Is \space L(G) = L(G)^*?”$ is undecidable. Argue $\text(a)$ from Rice’s theorem and $\text(b)$ from first principles.
For an unrestricted grammar $G$, show that the question $“Is \space L(G) = L(G)^*?”$ is undecidable. Argue $\text(a)$ from Rice’s theorem and $\text(b)$ from first principles.
asked
Mar 16, 2019
in
Theory of Computation
Rishi yadav
28
views
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
0
votes
0
answers
2
25
views
Peter Linz Edition 5 Exercise 12.2 Question 7 (Page No. 311)
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable for any fixed $G_2,$ as long as $L(G_2)$ is not empty.
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable for any fixed $G_2,$ as long as $L(G_2)$ is not empty.
asked
Mar 16, 2019
in
Theory of Computation
Rishi yadav
25
views
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
0
votes
0
answers
3
30
views
Peter Linz Edition 5 Exercise 12.2 Question 6 (Page No. 311)
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable.
Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable.
asked
Mar 16, 2019
in
Theory of Computation
Rishi yadav
30
views
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
0
votes
0
answers
4
20
views
Peter Linz Edition 5 Exercise 12.2 Question 5 (Page No. 311)
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G) = L(G)^R$?$
Let $G$ be an unrestricted grammar. Does there exist an algorithm for determining whether or not $L(G) = L(G)^R$?$
asked
Mar 16, 2019
in
Theory of Computation
Rishi yadav
20
views
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
...