Gate Sample 2018
Consider PDA = M = ({q0, q1}, {a, b}, {a, z0}, δ, q0, z0, φ) which accepts by empty stack δ: (q0, a, z0) = (q0, az0) (q0, a, a) = (q0, aa) (q0, b, a) = (q1, a) (q1, b, a) = (q1, a) (q1, a, a) = (q1, ε) (q1, ... given corresponds to the language ={/ >0,>0} how ? in transition 4th line (q1, b, a) = (q1, a) we dont perform pop operation for a then how is explanation correcT?
Consider PDA = M = ({q0, q1}, {a, b}, {a, z0}, δ, q0, z0, φ) which accepts by empty stack δ: (q0, a, z0) = (q0, az0) (q0, a, a) = (q0, aa) (q0, b, a) = (q1, a) (q1, b, a) = (q1, a) (q1, a, a) = (q1, ε) (q1, ε, z0) ... : The transitions given corresponds to the language ={/ >0,>0} how ? in transition 4th line (q1, b, a) = (q1, a) we dont perform pop operation for a then how is explanation correcT?
asked
Nov 19, 2017
in Theory of Computation
Pranav Madhani
1.5k views