Finding automata for modulo relation
first construct state table then draw automata.
|
0 |
1 |
A |
A |
B |
B |
C |
D |
C |
E |
A |
D |
B |
C |
E |
D |
E |
State A corresponds to remainder '0' and state B corresponds to remainder '1,and state C corresponds to remainder '2',and so on.
Minimal no of state in automata is 5
Construction of table is for mod5 we need 5 states because 5 remainders(0,1,....4)
In every coloumn write sequentially states like A,B,C,D,E,A,B,C....repeat this procedure.
this is generalization for easy understanding.