Register

Recent questions tagged lemma

2 2 votes
1 1 answer
632
632 views
Pumping Lemma problem
0^3m over the alphabets {0,1} , m E I+ is a regular language right? We can draw the DFA for it.Which means it cannot be tested using pumping lemma for regularity, but sin...
User Avatar
0 0 votes
0 0 answers
844
844 views
TOC Pumping Lemma
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constrain...
User Avatar
4 4 votes
2 answers 2 answers
3.3k
3.3k views
Pumping Lemma
User Avatar
0 0 votes
1 1 answer
954
954 views
Pumping lemma for CFG in alternative normal form
Let us say that a CFG is given in the following normal form where every production is of either typeNon-terminal →Non-terminal Non-terminal Non-terminalNon-terminal → sin...
User Avatar
To see more, click for the full list of questions or popular tags.