Question: 3. (10 points) Consider the PDA over the input alphabet 0,1 with the state diagram qo q1 a. What is the stack alphabet, ?, for

3. (10 points) Consider the PDA over the input alphabet 0,1 with the state diagram qo q1 a. What is the stack alphabet, ?, for this PDA? b. From which states might a computation of this PDA make a move that doesn't consume input and doesn't push anything onto the stack? c. From which states might a computation of this PDA make a move that doesn't change the contents of the stack? d. At the end of a successful computation of this PDA on a string w, can the stack be nonempty? e. Is the string E accepted by this PDA? f. Is the string 01 accepted by this PDA? g. Is the string 110 accepted by this PDA? h. Is the string 0110 accepted by this PDA? i. For all strings w, if w is accepted by this PDA, is wR guaranteed to be accepted by the PDA as well? j. Is the language of this PDA infinite
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
