Question: 1. (C1) For each of the given strings, state whether or not the pushdown automaton below would accept or reject it. a, Ea b, a

1. (C1) For each of the given strings, state whether or not the pushdown automaton below would accept or reject it. a, Ea b, a E E, E $ E, $ E 91 42 93 1. babababa 2. aababbab 3. abababba 2. (C2) For each of the given strings, state whether or not the context-free grammar below generates it. The start symbol is S. S + SST T + aTb ab 1. abaabb 2. aaabbb 3. aabbabab
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
