Finite automata FA for the language of all those strings startig and ending with same letters in theory of automata

Built the Finite automata (FA) for the language of all those strings begining and ending with same letters and having length two or more?

FA in theory of computation

Accepted Strings

You should check some small, some medium and some large size strings that are part of the language and all of them(100% strings) should be accepted by our FA.

Small strings:

aa, bb, aba, bab, …… and all those strings begining and ending with same letters and having length two or more

Medium size strings:

abaaababa,  babababaab……and all such strings that are starting and ending with same letter and having length of string two or more

Large size strings:

ababbabaaabaabbba, baababbbbaaababababb,…….and all such strings that are starting and ending with same letter and having length of string two or more

Rejected Strings

You should check some small, some medium and some large size strings that are not  part of the language and all of them(100% strings) should be rejected by our FA.

Small strings:

a, b, ab, ba, abb, baa….. and all such strings that are not starting and ending with same letter and does not having length of string two or more.

Medium size strings:

ababab, bababbaba ……and all such strings that are not starting and ending with same letter and does not having length of string two or more.

Large size strings:

ababbababababbabababbabab,   bababababbabbbaaaaba…….and all such strings that are not starting and ending with same letter and does not having length of string two or more.