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î

Danish Ather; Raghuraj Singh; Vinodani Katiyar

Research Article

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î

by Danish Ather, Raghuraj Singh, Vinodani Katiyar

International Journal of Computer Applications

Foundation of Computer Science (FCS), NY, USA

Volume 60 - Issue 10

Published: December 2012

Authors: Danish Ather, Raghuraj Singh, Vinodani Katiyar

10.5120/9731-4206

PDF

Danish Ather, Raghuraj Singh, Vinodani Katiyar . 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î. International Journal of Computer Applications. 60, 10 (December 2012), 37-40. DOI=10.5120/9731-4206

                        @article{ 10.5120/9731-4206,
                        author  = { Danish Ather,Raghuraj Singh,Vinodani Katiyar },
                        title   = { 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î },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 60 },
                        number  = { 10 },
                        pages   = { 37-40 },
                        doi     = { 10.5120/9731-4206 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }

                        %0 Journal Article
                        %D 2012
                        %A Danish Ather
                        %A Raghuraj Singh
                        %A Vinodani Katiyar
                        %T 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î%T 
                        %J International Journal of Computer Applications
                        %V 60
                        %N 10
                        %P 37-40
                        %R 10.5120/9731-4206
                        %I Foundation of Computer Science (FCS), NY, USA

Abstract

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".

References

Hopcroft, John E. ; Motwani, Rajeev; Ullman, Jeffrey D. (2001). Introduction to Automata Theory, Languages, and Computation (2 ed. ). Addison Wes-ley. ISBN 0-201-44124-1. Retrieved 19 November 2012.
Lawson, Mark V. (2004). Finite automata. Chapman and Hall/CRC. ISBN 1-58488-255-7. Zbl 1086. 68074.
McCulloch, W. S. ; Pitts, E. (1943). "A logical cal-culus of the ideas imminent in nervous activity". Bulletin of Mathematical Biophysics: 541‚Äì544.
Rabin, M. O. ; Scott, D. (1959). "Finite automata and their decision problems. ". IBM J. Res. Develop. : 114‚Äì125.
Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge University Press. ISBN 978-0-521-84425-3. Zbl 1188. 68177.
Sipser, Michael (1997). Introduction to the Theory of Computation. Boston: PWS. ISBN 0-534-94728-X. . Section 1. 1: Finite Automata, pp. 31‚Äì47. Subsection "Decidable Problems Concerning Regular Languages" of section 4. 1: Decidable Languages, pp. 152‚Äì155. 4. 4 DFA can accept only regular lan-guage
C. Allauzen and M. Mohri, Finitely subsequential transducers, International J. Foundations Comp. Sci. 14 (2003), 983-994
M. -P. B√©al and O. Carton, Determinization of trans-ducers over finite and infinite words, Theoret. Comput. Sci. 289 (2002), 225-251
Bruggemann-Klein, Regular expressions into finite automata, Lecture Notes in Computer Science 583 (1992), 87-98
J. Carroll and D. Long, Theory of Finite Automata, Prentice-Hall, Englewood Cliffs, NJ, 1989.
M. V. Lawson, Finite Automata, CRC Press, Boca Raton, FL, 2003.
D. Perrin, Finite automata, in Handbook of Theoret-ical Computer Science, Volume B (editor J. Van Leeuwen), Elsevier, Amsterdam, 1990, 1-57.
D. Perrin and J. E. Pin, Infinite Words, Elsevier, Amsterdam, 2004.
Ch. Reutenauer, Subsequential functions: characte-rizations, minimization, examples, Lecture Notes in Computer Science 464 (1990), 62-79.
J. Sakarovitch, Kleene's theorem revisited, Lecture Notes in Computer Science 281(1987), 39-50.
E. Roche and Y. Schabes (editors), Finite-State Language Processing, The MIT Press, 1997.
B. W. Watson, Implementing and using finite auto-mata toolkits, in Extended Finite State Models of Language (editor A. Kornai), Cambridge University Press, London, 1999, 19-36.

Index Terms

Computer Science

Information Sciences

No index terms available.

Keywords

DFA Transition Table MOD