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
Peter Linz Edition 5 Exercise 11.3 Question 4 (Page No. 296)
0
votes
16
views
Show that the family of contextsensitive languages is closed under reversal.
peterlinz
peterlinzedition5
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
proof
asked
Mar 18, 2019
in
Theory of Computation
by
Rishi yadav

16
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
Peter Linz Edition 5 Exercise 11.3 Question 3 (Page No. 296)
Show that the family of contextsensitive languages is closed under union.
asked
Mar 18, 2019
in
Theory of Computation
by
Rishi yadav

27
views
peterlinz
peterlinzedition5
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
proof
0
votes
0
answers
2
Peter Linz Edition 5 Exercise 11.2 Question 4 (Page No. 290)
Prove that constructed grammar cannot generate any sentence with $a\space b$ in it. $S\rightarrow S_1B,$ $S_1\rightarrow aS_1b,$ $bB\rightarrow bbbB,$ $aS_1b\rightarrow aa,$ $B\rightarrow \lambda$
asked
Mar 18, 2019
in
Theory of Computation
by
Rishi yadav

14
views
peterlinz
peterlinzedition5
theoryofcomputation
proof
turingmachine
recursiveandrecursivelyenumerablelanguages
0
votes
0
answers
3
Peter Linz Edition 5 Exercise 11.3 Question 6 (Page No. 296)
Without explicitly constructing it, show that there exists a contextsensitive grammar for the language $L=\{www^R: w,u\in\{a,b\}^+,w\gequ\}$.
asked
Mar 18, 2019
in
Theory of Computation
by
Rishi yadav

30
views
peterlinz
peterlinzedition5
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
0
votes
0
answers
4
Peter Linz Edition 5 Exercise 11.3 Question 5 (Page No. 296)
$\text{Theorem}:$ Every contextsensitive language $L$ is recursive. For $m$ in Theorem, give explicit bounds for $m$ as a function of $w$ and $V\cup T$.
asked
Mar 18, 2019
in
Theory of Computation
by
Rishi yadav

11
views
peterlinz
peterlinzedition5
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
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
IISc CDS Interview Experience, 2020
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
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
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Today's test will be late  either midnight or...
on what time will be today's test?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,522
answers
201,950
comments
95,372
users