1. (40) Fill the following table with words REGULAR, CFL, RECURSIVE, RE (for recursively enumerable), NRE (for non-recursively enumerable), whichever is the most appropriate. For example, for the language L- (a], you should use REGULAR even though it is also a CFL, recursive, and recursively enumerable. Note that we do not have 'Context Sensitive" category. If you think a language is context sensitive, please use the word RECURSIVE. L! =(abc" lij, k > 0 and i=j or i=k} L3 = {0" l n is a multiple of 101) L5kM, w> I w in , M is a DFA and M accepts w = , is some alphabet. = The Halting problem ATM L8 a finite set Lo - The union of any finite number of recursively enumerable languages 12 = {apti I p is a prime number) regular 114 = The intersection of any finite number of recursively enumerable languages 16 {w/ w E(a, b } is a palindrome} Li,-{ | M is a Turing machine and M does not accept L18 = L(G), G: S Sa | Sb L19 : {w/ w E( a, b)' where #a,s-#b's in 1. (40) Fill the following table with words REGULAR, CFL, RECURSIVE, RE (for recursively enumerable), NRE (for non-recursively enumerable), whichever is the most appropriate. For example, for the language L- (a], you should use REGULAR even though it is also a CFL, recursive, and recursively enumerable. Note that we do not have 'Context Sensitive" category. If you think a language is context sensitive, please use the word RECURSIVE. L! =(abc" lij, k > 0 and i=j or i=k} L3 = {0" l n is a multiple of 101) L5kM, w> I w in , M is a DFA and M accepts w = , is some alphabet. = The Halting problem ATM L8 a finite set Lo - The union of any finite number of recursively enumerable languages 12 = {apti I p is a prime number) regular 114 = The intersection of any finite number of recursively enumerable languages 16 {w/ w E(a, b } is a palindrome} Li,-{ | M is a Turing machine and M does not accept L18 = L(G), G: S Sa | Sb L19 : {w/ w E( a, b)' where #a,s-#b's in