CSE 355 Intro Theoretical Computer Sci Student ID: Homework 3 1. (20 points: 5 points each) For each of the following languages, determine whether the language is Regular or not. Prove your answer. In case you decide that the language is regular, provide a regular expression, or use the pumping lemma to prove that the language is not regular. 1. Lw 0,1 w follows 0'13 pattern, provided i>j>o ) 2. L2 -{ w e [01* | w follows 0'0'o* pattern, provided ij,k 0 3. Ls- wE (0,1) w is a palindrome string ) (Note: Palindrome strings are strings which can be read same forward and backward) 4. L4wEw has form where k is a multiple of 3 or multiple of 5 ) (Note: Strings of form k denote k consecutive occurrence of 1, E 14)