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

By: Prof. Fazal Rehman Shamil
Last modified on April 14th, 2021

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 100+ Important Deterministic Finite Automata

Finite Automata Exercise Solution

Here I am showing you a list of some more important Deterministic Finite Automata used in the theory of automata and theory of computation.

  1. DFA for  (a+b)* (a+b)a .
  2. DFA for (bb)*(aa)* .
  3. DFA for  b+a(a+b)*+a.
  4. DFA for (a+b)*b+(bb)*a.
  5. DFA for bb+a(a+b)*+aa.
  6. DFA for  a(a+b)*+bb(a)* .
  7. DFA for  a(a+b)b*+bb(a)*.
  8. DFA for  b(aa)*a+a(bb)*b.
  9. DFA for a+a(aa+b)*(aa)b.
  10. DFA for a+a(aa+b)*+(aa)b.
  11. DFA for (a+b)b(a+b)*+(aa)*b.
  12. FA for strings starting with a and ending with a.
  13. FA for the language of all those strings starting with a.
  14. FA for the language of all those strings containing aa as a substring.
  15. DFA for the language of all those strings starting and ending with the same letters.
  16. DFA for the language of all those strings starting and ending with different letters.
  17. DFA for the language of all those strings having double 0 or double 1.
  18. DFA for the language of all those strings starting and ending with b.
  19. DFA for ending with b.
  20. DFA for the string of even A’s and even b’s.
  21. DFA for the regular expression of  a(a+b)*+(bb)+a(ba)*+aba+bb*(a+b)*.
  22. RegExp and DFA for strings having triple a’s or triple b’s.