To Develop an Efficient Algorithm that Generalize the Method of Design of Finite Automata that Accept "N" base Number such that when "N" is Divided by "M" Leaves Reminder "X"

Theory of computation is always been an issue for the students to understand.So there is a research gap which will ease the process of teaching learning.Our research objective is to develop method to make teaching learning process of theory of computation easier, simpler and understandable.In this paper we develop an algorithm and a tool based on the same algorithm which will generalize the design of finite automata that accept "N" base number such that when "N" is divided by "M" leaves reminder "X" i.e. "X" MOD "M".