1 votes 1 votes What will be the DPDA of a language L = {aibj|for every prefix of the string |n(a)-n(b)|≤2 where n(a)=number of a & n(b)=number of b} Theory of Computation theory-of-computation + – Bencher Last asked Jul 21, 2017 Bencher Last 230 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.