let's we have a language L = X n Y 2n Where a) n>=1 b) n>=0 Give a context free grammars that generate the following languages EVALUATE at least four strings for the given CFGs Let's we have a...

let's we have a language L = X
n

Y

2n

Where

a) n>=1

b) n>=0

Give a context free grammars that generate the following languages

EVALUATE at least four strings for the given CFGs

Let's we have a Palindrome language having even length over alphabet {e,f}

Construct a PDA

Construct a Turing Machine

Draw a DFA