Oops! It appears that you have disabled your Javascript. In order for you to see this page as it is meant to appear, we ask that you please re-enable your Javascript!

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.

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