Finite Automata

By: Prof. Dr. Fazal Rehman | Last updated: December 28, 2023

Let us see the Finite Automata of Regular Expression bb+a(a+b)*+aa.
Finite Automata

Explanation of Finite Automata

  • 2 Accepted strings of length 1={a, no more possible string}
  • 2 Accepted strings of length 2={bb, ab, and many more similar strings }
  • 2 Accepted strings of length 5={aaaaa, abbbb and many more similar strings}
  • 2 Accepted strings of length 8={aaaaaaaa, abbbbbbb and many more similar strings }
  • 2 Accepted strings of length 10={aaaaaaaaaa, abbbbbbbbb and many more similar strings }
  • 2 Accepted strings of length 15={ aaaaaaaaaaaaaaa,  abbbbbbbbbbbbbb and many more similar strings }
  • 2 Accepted strings of length 20={ aaaaaaaaaaaaaaaaaaaa, abbbbbbbbbbbbbbbbbbb and many more similar strings }
  • 2 Accepted strings of length 25={ aaaaaaaaaaaaaaaaaaaaaaaaa, abbbbbbbbbbbbbbbbbbb and many more similar strings }
  • and many more similar strings

How to read strings from Finite Automata?

How to read a? 0 to 1 How to read bb? 0 to 3 | 3 to 2 How to read ab? 0 to 1 |  1 to 1 How to read aaaaa? 0 to 1 | 1 to 1 | 1 to 1 | 1 to 1 | 1 to 1 |   How to read abbbb ? 0 to 1 |1 to 1 |1  to 1 | 1 to 1 | 1 to 1  | How to read aaaaaaaa ? 1 to 1 |1  to 1  | 1 to 1 | 1  to 1 | 1  to 1 | 1  to 1 | 1 to 1 | 1 to 1 | How to read abbbbbbb? 0 to 1 | 1to 1 | 1 to 1 | 1  to 1 | 1 to 1 | 1  to 1 | 1  to 1 | 1 to 1 | How to read aaaaaaaaaa? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | How to read abbbbbbbbb? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | How to read aaaaaaaaaaaaaaa? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | 1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | How to read abbbbbbbbbbbbbb? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | 1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  | How to read aaaaaaaaaaaaaaaaaaaa? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | How to read abbbbbbbbbbbbbbbbbbb? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | How to read aaaaaaaaaaaaaaaaaaaaaaaaa? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 How to read abbbbbbbbbbbbbbbbbbb? 0  to 1  | 1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 to 1 |1  to 1  | 1 to 1  |1 to 1  | 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1

Video Lecture

List of 100+ Important Deterministic Finite Automata

Leave a Comment

All Copyrights Reserved 2025 Reserved by T4Tutorials