Finite Automata(FA) in Compiler Construction and Design

Let us see an example of Finite Automata(FA) in Compiler Construction and Design. 

Regular Expression : b(aa)*a+a(bb)*b

Finite Automata(FA) in Compiler Construction and Design

Strings of FA (Automata)

  • Accepted strings of length 1={no Strings}
  • Accepted strings of length 2={ba, ab}
  • Accepted strings of length 5={ No Strings}
  • Accepted strings of length 8={baaaaaaa,abbbbbbb, no more strings}
  • Accepted strings of length 10={baaaaaaaaa,abbbbbbbbb, no more strings}
  • Accepted strings of length 15={No Strings}
  • Accepted strings of length 20={baaaaaaaaaaaaaaaaaaa, abbbbbbbbbbbbbbbbbbb, no more strings}
  • Accepted strings of length 25={No Strings}

How to read strings from FA?

How to read ba?

0 to 3 | 3 to 4

How to read ab?
0 to 1 | 1 to 2

How to read baaaaaaa?

0 to 3 | 3 to 3 | 4 to 3 | | 3 to 3 | 4 to 3 || 3 to 3 | 4 to 3 | 3 to 4

How to read abbbbbbb?

0 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1| 1 to 2 | 2 to 1 | 1 to 2

How to read baaaaaaaaa?

0 to 3 | 3 to 3 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 4 | 4 to 3 | 3 to 4

How to read abbbbbbbbb?

0 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1| 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1 | 1 to 2

How to read baaaaaaaaaaaaaaaaaaa?

0 to 3 | 3 to 3 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 4 | 4 to 3 | 3 to 4 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 3 | 4 to 3 | 3 to 4 | 4 to 3 | 3 to 4 | 4 to 3 | 3 to 4

How to read abbbbbbbbbbbbbbbbbbb?

0 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1| 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1|
1 to 2 | 2 to 1 | 1 to 2 | 2 to 1 | 1 to 2 | 2 to 1 | 1 to 2

Video Lecture

List of 100+ Important Deterministic Finite Automata

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

Buy advertisement space on T4Tutorials

For more details email [email protected]