regular language pumping lemma for string with even 0's -
find whether string number of zeros a) context free b)regular
a) using pumping lemma cfl....it can represented e(0n)e(0n)e. , it's cfl.
b) can represented (00)*
in regex. so, think it's regular language. but, not able prove same using pumping lemma regular languages
any appreciated. thanks!!
Comments
Post a Comment