Recent activity by Bencher Last

0 answers
2
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}