1 / 8

Examples

Examples. Applying Pumping Lemma. Proof by contradiction: Let be accepted by a k -state DFA. Choose For all prefixes of length show there exists such that i.e.,. Choose

kaden-bradshaw
Download Presentation

Examples

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Examples Applying Pumping Lemma L11PLEG

  2. Proof by contradiction: • Let be accepted by a k-state DFA. • Choose • For all prefixes of length • show there exists such that • i.e., L11PLEG

  3. Choose (For this specific problem happens to be independent of j, but that need not always be the case.) • is non-regular because it violates the necessary condition. L11PLEG

  4. Proof :(For this example, choice of initial string is crucial.) • For this choice of s, the pumping lemma cannot generate a contradiction! • However, let instead. L11PLEG

  5. For • Thus, by pumping the substring containing a’s 0 times (effectively deleting it), the number of a’s can be made smaller than the number of b’s. • So, by pumping lemma, L is non-regular. L11PLEG

  6. Proof by contradiction: • If is regular, then so is , the complement of • But which is known to be non-regular. • So, cannot be regular. • Proving to be non-regular using pumping lemma may be difficult/impossible. L11PLEG

  7. … Source of the problem? Regular (ultimately periodic) Prime (sparse) … Composite(dense) … L11PLEG

  8. Summary of Proof Techniques Employed • Counter Examples • Constructions/Simulations • Induction Proofs • Impossibility Proofs • Proofs by Contradiction • Reduction Proofs : Closure Properties L11PLEG

More Related