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:Regular expression for strings end in a double letter (two a’s or two b’s)finite automata for the language of all those strings having double 0 or double 1 in theory of automata Regular Expression for strings having at least one double 0 or double 1Conclusion of a formal & informal letter | How to conclude a letter?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 automata