257 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
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
3
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?
0 votes
0 votes
1 answer
4
srestha asked Apr 19, 2019
651 views
How by Pumping Lemma we can prove that“context free grammar generate an infinite number of strings”and here what could be pumping length ?