Finite Automata of all strings divisible by 4 Finite automata of all strings divisible by 4 Related Posts: Finite automata FA for the language of all those strings starting with a and ending with a in theory of automataFinite automata FA for the language of all those strings starting and ending with same letters in theory of automataFinite automata for the language of all those strings starting and ending with different letters in theory of automata finite automata for the language of all those strings having double 0 or double 1 in theory of automataFinite automata FA for the language of all those strings starting and ending with b in theory of automataFinite automata for all strings with at least one a