Subject: Automata and Theory of Computation

PART A Show a context-free grammar for each of the following languages over the [ = {a, b, c], 1. All strings in the language (= (a bich, where k = 2i ) 2, All nonempty strings that start and end with the same symbol PART B Write regular expressions for the following languages over the alphabet I = (a, b} 1 All strings that contain an even number of a's 2, All nonempty strings that start and end with the same symbol