Finite automata with Examples and output

Last modified on May 15th, 2020 Download This Tutorial in PDF
Let us see the Finite automata with Example and with output. 
Suppose the Regular Expression is (a+b)* (a+b)a.
Finite automata with Example with output
  • 2 Accepted strings of length 1={ no possible string}
  • 2 Accepted strings of length 2 = {aa , ba, no more possible string }
  • 2 Accepted strings of length 5 = {ababa , bbaaa, and many more similar strings}
  • 2 Accepted strings of length 8 = {ababbaaa , bbabaaba, and many more similar strings }
  • 2 Accepted strings of length 10 = {aaabbababa , babaaabbaa, and many more similar strings }
  • 2 Accepted strings of length 15 = {ababbaababbabaa , bbbaabbababbaba, and many more similar strings }
  • 2 Accepted strings of length 20 = {aaabbbbbbbbbbaaaabba , bbaaabbaabbabababbaa, and many more similar strings }
  • 2 Accepted strings of length 25={ababababbbbbbaaabbbbaabaa , bbbaaaabbabababababaaabba , Andmany more similar strings }
  • And many more similar strings

How to read aa?  

0 to 1 | 1 to 2|

How to read ba?

0 to 1 | 1 to 2|

How to read ababa?

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

How to read bbaaa?

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

How to read ababbaaa?

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

How to read bbabaaba?

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

How to read aaabbababa?

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

How to read babaaabbaa?

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

How to read ababbaababbabaa?

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

How to read bbbaabbababbaba?

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

How to read aaabbbbbbbbbbaaaabba?

0 to 1 | 1 to 2 | 2 to 2 | 2 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 2 | 2 to 2 |2 to 2 |2 to 2 | 2 to 1 | 1 to 1 | 1 to 2 |

How to read bbaaabbaabbabababbaa?

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

How to read ababababbbbbbaaabbbbaabaa?

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

How to read bbbaaaabbabababababaaabba?

0 to 1 | 1 to 1 | 1 to 1 | 1 to 2 | 2 to 2 | 2 to 2 | 2 to 2 | 2 to 1 | 1 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 2 | 2 to 2 | 2 to 1 | 1 to 1 | 1 to 2 |

  • 2 Accepted strings of length 1={ no possible string}

 

  • 2 Accepted strings of length 2={aa , ba , no more possible string }

 

  • 2 Accepted strings of length 5={ababa , bbaaa , and many more similar strings}

 

  • 2 Accepted strings of length 8={ababbaaa , bbabaaba , and many more similar strings }

 

  • 2 Accepted strings of length 10={aaabbababa , babaaabbaa , and many more similar strings }

 

  • 2 Accepted strings of length 15={ababbaababbabaa , bbbaabbababbaba , and many more similar strings }

 

  • 2 Accepted strings of length 20={aaabbbbbbbbbbaaaabba , bbaaabbaabbabababbaa , and many more similar strings }

 

  • 2 Accepted strings of length 25={ababababbbbbbaaabbbbaabaa , bbbaaaabbabababababaaabba , Andmany more similar strings }

 

  • Andmany more similar strings

 

How to read aa?  

0 to 1 | 1 to 2|

How to read ba?

0 to 1 | 1 to 2|

How to read ababa?

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

How to read bbaaa?

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

How to read ababbaaa?

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

How to read bbabaaba?

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

How to read aaabbababa?

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

How to read babaaabbaa?

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

How to read ababbaababbabaa?

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

How to read bbbaabbababbaba?

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

 

 

How to read aaabbbbbbbbbbaaaabba?

0 to 1 | 1 to 2 | 2 to 2 | 2 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 2 | 2 to 2 |2 to 2 |2 to 2 | 2 to 1 | 1 to 1 | 1 to 2 |

How to read bbaaabbaabbabababbaa?

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

How to read ababababbbbbbaaabbbbaabaa?

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

How to read bbbaaaabbabababababaaabba?

0 to 1 | 1 to 1 | 1 to 1 | 1 to 2 | 2 to 2 | 2 to 2 | 2 to 2 | 2 to 1 | 1 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 2 | 2 to 2 | 2 to 1 | 1 to 1 | 1 to 2 |

Video Lecture

List of 100+ Important Deterministic Finite Automata

Subscribe for Friendship

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