Question: (4 points) Question 4: The pushdown automaton below recognizes L={a^(i)b^(j)c^(k)|i=j or j=k}. That is, all strings of a's followed by b's followed by c's
(4 points) Question 4: The pushdown automaton below recognizes\
L={a^(i)b^(j)c^(k)|i=j or j=k}.\ That is, all strings of a's followed by b's followed by c's with either an equal number of a's and b's (state
q_(ab)) or an equal number of b's and c's (state
q_(bc)).\ Which TWO of the following are true of the
q_(2)->q_(2)transition (the loop above
q_(2))?\ a.) The symbol a must be next in the string being computed to make the transition.\ b.) The symbol b must be next in the string being computed to make the transition.\ c.) The transition can be made regardless of the next symbol in the string being computed.\ d.) The symbol a is popped from the stack in making the transition.\ e.) The symbol b is popped from the stack in making the transition.\ f.) The symbol a is pushed onto the stack in making the transition.\ g.) The symbol b is pushed onto the stack in making the transition.\ h.) The stack is left unchanged in making the transition.\ i.) The transition can be made only when computing strings with the same number of b's as c's.

(4 points) Question 4: The pushdown automaton below recognizes L={aibjcki=jorj=k}. That is, all strings of a's followed by b's followed by c's with either an equal number of a's and b's (state qab ) or an equal number of b's and c's (state qbc ). Which TWO of the following are true of the q2q2 transition (the loop above q2 )? a.) The symbol a must be next in the string being computed to make the transition. b.) The symbol b must be next in the string being computed to make the transition. c.) The transition can be made regardless of the next symbol in the string being computed. d.) The symbol a is popped from the stack in making the transition. e.) The symbol b is popped from the stack in making the transition. f.) The symbol a is pushed onto the stack in making the transition. g.) The symbol b is pushed onto the stack in making the transition. h.) The stack is left unchanged in making the transition. i.) The transition can be made only when computing strings with the same number of b's as c's
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
