651 views

1 Answer

1 votes
1 votes
The pumping length would be $b^{V+1}$ where b is the maximum no of symbols on the right hand side of a production and V is the number of variables in the Grammar.

Related questions

0 votes
0 votes
0 answers
2
jg662 asked Feb 22
67 views
Use the Pumping Lemma to show that the following languages over Σ={�,�}Σ={a,b} are not regular. In each case, carefully describe the string that will be pumped and ...
0 votes
0 votes
1 answer
4
shallowfalcon asked Oct 17, 2022
425 views
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?