1) Let G3 = ({S}, {a,b}, ?, S) be a grammar, where the set of rules I is defined as follows:
S? aSbSa
S? bSbSa
S ? aSbSb
S? ?
a)
Does there exist a regular expression R such that L(R) = L(G3)? If it exists,
provide such R; otherwise, simply put 0.
Let L = {c^{2n-1}a^m c^3 b^{2m+1} a^n | n, m > 0}.
b)
Complete the following context-free grammar G such such L(G) = L.
S ? ccSa | < missing string >
A ? aAbbb | aBbb
B ? ccc
Provide the missing string as a single line in the given text file (e.g., if your response is xSSy, submit
a file with a single line containing string "xSSy" (of course, without the quotes)).
c)
Does there exist a regular expression, DFA, regular grammar or PDA over
the alphabet ? = {a, b, c} which is equivalent to the language L? (Answer the following question as
a string of bits that translate to 1 for yes and 0 for no. For example, if your answer is "no, no, yes, no"
give your response as 0010).