Register

Pumping lemma

• retagged by
685 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · CountersNext → · Logical Address in P...
← Previous in category · Np Hard ProblemsNext in category → · Context free grammar...
Position:
Show:

Related questions

0 0 votes
1 1 answer
652
652 views
gateexplore asked Jun 23, 2023
652 views
Theory of Computation
Find a Greibach normal form grammar equivalent to the following CFG.S →ASB/ ABA→ aB → b
2 2 votes
1 1 answer
7.2k
7.2k views
hustlerrr asked Nov 17, 2021
7,168 views
Greibach Normal Form
Convert the following grammar into Greibach Normal Form.E- E + T | TT- T*F | FF->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide ...
1 1 vote
1 1 answer
622
622 views
Naveen Kumar 3 asked Apr 19, 2019
622 views
Peter Linz Edition 4 Exercise 6.2 Question 14 (Page No. 170)
Can every linear grammar be converted to a form in which all productions look like $A → ax,$ where $a∈ T$ and $x∈V$ $\cup$ {$\lambda$} ?
1 1 vote
0 0 answers
418
418 views
Naveen Kumar 3 asked Apr 19, 2019
418 views
Peter Linz Edition 4 Exercise 6.2 Question 13 (Page No. 170)
Convert the grammar $S\rightarrow ABb|a,$ $A\rightarrow aaA|B,$ $B\rightarrow bAb$into Greibach normal form.