This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: L 1 ∪ L 2 is nonregular. 8. If L 1 is regular, L 2 is nonregular, and L 1 ∩ L 2 is nonregular, then L 1 ∪ L 2 is nonregular. Problem 3 . (18 pts.) A number of languages over { , 1 } are described below. In each case, decide whether the language is regular or not, and prove your answer is correct. 1. The set of all strings x beginning with a nonnull string of the form ww . 1 2. The set of all strings x containing some nonnull substring of the form ww . 3. The set of oddlength strings over { , 1 } with the middle symbol 0. 4. The set of evenlength strings over { , 1 } with the two middle symbols equal. 5. The set of string over { , 1 } of the form xyx for some x with  x  ≥ 1 . 6. The set of nonpalindromes. 2...
View
Full Document
 Spring '10
 Mr.ElieNasr
 Pumping lemma for regular languages

Click to edit the document details