Finite automata for strings end in a double letter (two a’s or two b’s) Finite automata for strings end in a double letter (two a’s or two b’s) Related Posts:finite automata for the language of all those strings having double 0 or double 1 in theory of automataRegular expression for strings end in a double letter (two a’s or two b’s)Regular Expression for strings having at least one double 0 or double 1Finite automata FA for the language of all those strings starting with a and ending with a in theory of automata Finite 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