Glushkov, The abstract theory of automata, Russian Mathematical Surveys (Uspekhi Matematicheskikh Nauk) 16(5) (1961), 3 – 62, URL: (in Russian). Salomaa, Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography, World Scientific Publishing Co. Burton, Elementary Number Theory, Tata McGraw-Hill Education (2006).Ĭ. 321 – 330, (1999), Mathematics and Its Applications book series (MAIA, Vol. Allouche, Cellular automata, finite automata, and number theory, in: Cellular Automata, pp. Bell, Automata in Number Theory (Chapter 25), CNRS and University of Waterloo (2018), URL. This is the novelty of the article.įinally, we conclude with certain examples and non-examples alike!ī. Paper is that residue classes can be recognized by finite automaton. In deterministic finite automata, theĪcceptable strings give the solutions of the Chinese Remainder Theorem (CRT). Theorem using the Cartesian product of finite automata theory. Also, an effort has been put to solve certain problems of the Chinese Remainder In this paper, an attempt has been made to exhibit the relation between linear congruence andĪutomata theory. SimplyĪutomaton (plural: automata or automatons) is a self–operating machine. The system works without the intervention of man. The input mayīe energy, information, materials, etc. Automaton is a system that spontaneously gives an output from an input. Department of Mathematics, Dudhnoi College, Goalpara, Assam, Indiaĭepartment of Mathematics, Gauhati University, Assam, IndiaĪutomata, Cartesian product of DFA, Chinese Remainder Theorem Abstract
0 Comments
Leave a Reply. |