Question

Design a PDA recognizing each of the following languages and draw its state diagram. Note that the transition function must be in the format of "a,b ? c", namely we can only push/pop one symbol into/from the stack one time upon one input symbol. You will receive 0 point if you push/pop multiple symbols into/from the stack one time upon one input symbol. (1) \{w \mid w = a^nb^n, n is odd\} (2) \{w \mid w = w^R, length of w is odd and \Sigma = \{a,b\} \}

          Design a PDA recognizing each of the following languages and draw its state diagram.
Note that the transition function must be in the format of "a,b ? c", namely we can only push/pop one symbol
into/from the stack one time upon one input symbol. You will receive 0 point if you push/pop multiple symbols
into/from the stack one time upon one input symbol.
(1) \{w \mid w = a^nb^n, n is odd\}
(2) \{w \mid w = w^R, length of w is odd and \Sigma = \{a,b\} \}

$Design a PDA recognizing each of the following languages and draw its state diagram. Note that the transition function must be in the format of "a,b ? c", namely we can only push/pop one symbol into/from the stack one time upon one input symbol. You will receive 0 point if you push/pop multiple symbols into/from the stack one time upon one input symbol. (1) {w |w = a^nb^n, n is odd} (2) {w |w = w^R, length of w is odd and Σ= {a,b} }$

Added by Desiree B.

Question

Please give Ace some feedback