DFA in Theory of Computation and Automata

Last modified on May 15th, 2020 Download This Tutorial in PDF
Let us see an example of DFA in Theory of Computation and Automata.

Regular Expression

(a+b)b(a+b)*+(aa)*b  

DFA in Theory of Computation and Automata

Strings of DFA

  • Accepted strings of length 1={b, no more possible string}
  • Accepted strings of length 2={ab, bb, no more possible string }
  • Accepted strings of length 5={abaaa, bbbba, …… and many more similar strings }
  • Accepted strings of length 8={abaaaaab, bbaababa, …… and many more similar strings }
  • Accepted strings of length 10={ababbbaaaa, bbbbbbbbba, …… and many more similar strings }
  • Accepted strings of length 15={aaaaaaaaaaaaaab, bbaaaaaabbbabab, …… and many more similar strings }
  • Accepted strings of length 20={abaaabababababbbaaaba, bbababababababababab, …… and many more similar strings }
  • Accepted strings of length 25={aaaaaaaaaaaaaaaaaaaaaaab, bbaaaaaaaaaaaaaaaaaaaaaaa, …… and many more similar strings }
  • And many more similar strings

How to read strings from DFA?

How to read b?

0 to 5

How to read ab?

0 to 6| 6 to 4

How to read bb?

0 to 5| 5 to 4

How to read abaaa?

0 to 6| 6 to 4 | 4 to 4| 4 to 4| 4 to 4

How to read bbbba?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4

How to read abaaaaab?

0 to 6| 6 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read bbaababa?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read ababbbaaaa?

0 to 6| 6 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read bbbbbbbbba?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read aaaaaaaaaaaaaab?

0 to 6| 6 to 1| 1 to 3| 3 to 1| 1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1| 1 to 2

How to read bbaaaaaabbbabab?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read abaaabababababbbaaaba?

0 to 6| 6 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read bbababababababababab?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

How to read aaaaaaaaaaaaaaaaaaaaaaaab?

0 to 6| 6 to 1| 1 to 3| 3 to 1| 1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1|1 to 3| 3 to 1| 1 to 2

How to read bbaaaaaaaaaaaaaaaaaaaaaaaa?

0 to 5| 5 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4| 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4 | 4 to 4

Video Lecture

List of 100+ Important Deterministic Finite Automata

Subscribe for Friendship

Latest posts by Prof. Fazal Rehman Shamil (see all)