Abstract
. Automaton is a system that spontaneously gives an output from an input. The input maybe energy, information, materials, etc. The system works without the intervention of man. Simplyautomaton (plural: automata or automatons) is a self–operating machine. Its synonym is ROBOT.In this paper, an attempt has been made to exhibit the relation between linear congruence andautomata theory. Also, an effort has been put to solve certain problems of the Chinese Remaindertheorem using the Cartesian product of finite automata theory. In deterministic finite automata, theacceptable strings give the solutions of the Chinese Remainder Theorem (CRT). The main result of thepaper is that residue classes can be recognized by finite automaton. This is the novelty of the article.Finally, we conclude with certain examples and non-examples alike!
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
