GATEBOOK

Question

Consider a PDA P=({q},{0,1},{0,1,Z0},T,Q,Z0,{p})P=({q},{0,1},{0,1,Z0},T,Q,Z0,{p}), where TT consists of the transitions

δ(q,0,Z0)={(q,0Z0)}δ(q,0,Z0)={(q,0Z0)}

δ(q,1,Z0)={(q,1Z0)}δ(q,1,Z0)={(q,1Z0)}

δ(q,0,0)={(q,00)}δ(q,0,0)={(q,00)}

δ(q,0,1)={(q,ϵ)}δ(q,0,1)={(q,ϵ)}

δ(q,1,1)={(q,11)}δ(q,1,1)={(q,11)}

δ(q,1,0)={(q,ϵ)}δ(q,1,0)={(q,ϵ)}

δ(q,ϵ,Z0)={(p,ϵ)}δ(q,ϵ,Z0)={(p,ϵ)}

The language accepted by the following PDA is

1. {0n1n∣n≥0}{0n1n∣n≥0}
2. All palindromes with over 00's and 11's
3. All the strings with equal number of 00's and 11's
4. All the strings with more 00's then 11's

Comments

I think it is equal number of 0s and 1s.