Known Push Down Automata (PDA):

a. Check whether the string abca, abcab, bbcaa, abcba, abacba is accepted or rejected, then without searching whether the string 'ababaabbacabbabbaba' is accepted or rejected?

b. After checking some of the above strings, provide another Z string accepted and another Z string rejected?

Q = {90, 91, 92} S=90, = {a,b,c}, T = {X2}, F = { 92 Z= Z transition function as follows: 8(90, a, Z) = (q0, XZ) 8(90, b, Z) = (90, XZ) 8(90, a, X) = (90, XX) 8(90, b, X)=(q0, XX) 8(90, c, X)=(q1, X) 8(90, c, Z) = (q1, Z) 8(ql, a, X)=(q1, ) 8(91, b, X) = (q1, ) 8(91, , Z) =(92, Z)