Finite automata for the language of all those strings starting and ending with different letters in theory of automata

Built the FA for the language of all those strings in which all strings are starting and ending with different letters?

FSA 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:

ab, ba, aab, abb, baa….. and all such strings that are starting and ending with different letters.

Medium size strings:

ababab, bababbaba ……

and all such strings that are starting and ending with different letters.

Large size strings:

ababbababababbabababbabab,   bababababbabbbaaaaba…….

and all such strings that are starting and ending with different letters.

 

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, aa, bb, aba, bab….. and all such strings that are not starting and ending with different letters.

Medium size strings:

ababab, bababbaba ……and all such strings that are not starting and ending with different letters.

Large size strings:

ababbababababbabababbababa,   bababababbabbbaaaabab…….and all such strings that are not starting and ending with different letters.

  List of All Finite Automata examples: Click Here .