menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Peterlinz question

2 votes
207 views
Please write grammar for it and explain with example.

$L=\{w \: : n_a(w) > n_b(w) \}$
in Theory of Computation
edited by 207 views

1 Answer

1 vote
S -> ASb | bSA | SS | a  
A-> aA | a

edited by
1
is '$\epsilon$' present in language ?
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
193 views
Peterlinz exercise
Please solve this question with proper explanation: $L=\{ w : \: n_a(w) = 2n_b(w) \}$
Please solve this question with proper explanation: $L=\{ w : \: n_a(w) = 2n_b(w) \}$
asked Jul 8, 2016 in Theory of Computation Lakshya Mission 1 193 views
0 votes
1 answer
2
87 views
Michael Sipser Edition 3 Exercise 2 Question 9 (Page No. 155)
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why or why not$?$
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why or why not$?$
asked May 1, 2019 in Theory of Computation Lakshman Patel RJIT 87 views
0 votes
0 answers
3
77 views
Peter Linz Edition 4 Exercise 5.2 Question 16 (Page No. 145)
Show that the grammar with productions $S\rightarrow aAB,$ $A\rightarrow bBb,$ $B\rightarrow A|\lambda.$ is unambiguous.
Show that the grammar with productions $S\rightarrow aAB,$ $A\rightarrow bBb,$ $B\rightarrow A|\lambda.$ is unambiguous.
asked Apr 14, 2019 in Theory of Computation Naveen Kumar 3 77 views
0 votes
1 answer
4
91 views
Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
asked Apr 14, 2019 in Theory of Computation Naveen Kumar 3 91 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...