Question: Try with Pumping Lemma the language 0^2a1^2b i.e. String beginning with even number of 0s and ending with even number of 1s.
Solution: 1)Choose n. 2)Choose 0^2n1^2b. 3)Choose x = 0, y = 0^n-1, z = 1^2b 4)First iteration: xy^0z should belong to the language, xz=01^2b. It contains only one 0, its odd. So 0^2a1^2b is not RE. But I know I can write the corresponding RE as (00)*(11)*. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
