Register

Virtual Gate Test Series: Theory Of Computation - Context Sensitive Grammar

• edited by
423 views
0 votes
0 votes

How can L(G) be regular?
If we derive bSb --> bAcAb, now we have Ab-->b but we do not have the production bA since G is all production except last. So there is no production for A or bA. How can we go further?

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
preethi01 asked Jan 29, 2022
1,699 views
Context Sensitive Grammars
Is the following CSG for a^n b^n c^n correct? S->aSbC|abc Cb->bC C->c If not please explain why?
Is the following CSG for a^n b^n c^n correct?S->aSbC|abcCb->bCC->cIf not please explain why?
User Avatar
0 votes
0 votes
2 answers
2
Ravi prakash pandey asked Apr 7, 2018
603 views
context sensitive grammer
it is given that in csg if @-># then length of @ should be less or equal to # then how aaB->c is a csg???
it is given that in csg if @->#then length of @ should be less or equal to #then how aaB->c is a csg???
User Avatar
3 votes
3 votes
2 answers
3
Mahesha999 asked Dec 25, 2016
959 views
How can I tell if these languages are context sensitive
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?
User Avatar
1 votes
1 votes
1 answer
4
Neal Caffery asked Dec 2, 2016
1,065 views
context sensitive language
L = { ${\epsilon }$ } is a a) regular b) CFL c) CSL d) recursive language
L = { ${\epsilon }$ } is aa) regularb) CFLc) CSLd) recursive language
User Avatar
Link Copied!