Test 1 (COMP3560) - Introduction to Computer Theory Solve the following problems. Please write your answers in readable and clean form. 1. Consider a set of symbols - (ab.c) (I) Find all strings in * shorter than 3. (2) Let L { , ab, c). Is L a language on E? Why? (3) Write t and L. 2. Fill the proper word in the blank: (1) Given a grammar G, L(G) is the languageby G Given an automata M, L(M) is the language by M 3. Let y tab). Find the language generated by following grammar: (I) A aAl 1 (2) S bAal ba (3) S BA A bAalba 4, (1 Find a grammar that generates language L-(b"'a m 20, 21