finite automata for the language of all those strings having double 0 or double 1 in theory of automata

Built the finite automata for the language of all those strings having double 0 or double 1?

Let’s start drawing the FSA.

FSA in theory of automata

All strings that are part of the given language, must be accepted by our FSA, and all those strings that are not part of the given language must be rejected by FSA.

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:

00, 11, 011, 100…. and all those strings having double 0 or double 1

Medium size strings:

0010010, 1011001, 110011 ……and all those strings having double 0 or double 1

Large size strings:

011010101010101, 1010100101010100…….and all those strings having double 0 or double 1

 

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:

0, 1, 01, 10,…. and all those strings having no double 0 or double 1

Medium size strings:

010101010, 101010101……and all those strings having no double 0 or double 1

Large size strings:

010101010101, 1010101010101…….and all those strings having no double 0 or double 1

  List of All Finite Automata examples: Click Here .