construct a DPDA for this language is this a DCFL? a^i b^j such that i!=2j+1
my attempt: is for the first a I dont perform any action and then I start pushing 1 a for every 2a's but this is failing for i=2j+2 because it will have the same number of a's as i=2j+1
2j+2=1a for which we don't perform anything + j a's pushed on to the stack +1 a with no pair
2j+1 =1a for which we don't perform anything + j a's pushed on to the stack for rest of all the cases this is working fine except this please help