Finite-State-Machine DFA for Binary Numbers that are divisible by 3 PDA: a pushdown automaton, which accepts the following language: L2 = fu 2 fa; b; cg�j juja + jujb = jujc + 1 OR u = u1g