List of important Finite Automata – Homepage

List of important Finite Automata – Homepage

Here we have a list of important Finite Automata used in the theory of automata and theory of computation.

1 FA for strings starting with a and ending with a
2 FA for the language of all those string starting with a
3 FA for the language of all those string containing aa as a substring
4 FA for the language of all those strings starting and ending with same letters
5 FA for the language of all those strings starting and ending with different letters
6 FA for the language of all those strings having double 0 or double 1
7 FA for the language of all those strings starting and ending with b
8 FA for ending with b
9 FA for the string of even A’s and even b’s

 

Fazal Rehman Shamil
Welcome to all friends. The reason for our success is only your love for T4Tutorials. Our team is always available to answer your queries regarding any kind of confusions or discussion regarding your study and career matters. For discussion with us please join our facebook group "T4Tutorials.com". The link of the group is mentioned below. Thanks and love to all for connecting with us. We are nothing without you. Love you all.....
https://web.facebook.com/groups/2066136233601097/