answersLogoWhite

0


Best Answer

Theorem :- Let M=(Q,S,δ,q0,F) be an Finite Automate and has n number of states. Let L be the regular language accepted by M .Let for every string x in L, there exists a constant n such that |x|>=n. Now , if the string x can be broken into three sub strings u,v and w such that

x=uvw

satisfying the following constraints :

1. v≠ ɛ i.e., |v|>=0

2. |uv|<= n

then uv1w is in L for i>=0

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: State and prove pumping lemma for regular languages?
Write your answer...
Submit
Still have questions?
magnify glass
imp