We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach 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
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 60 - Number 10
Year of Publication: 2012
Authors: Danish Ather, Raghuraj Singh, Vinodani Katiyar
10.5120/9731-4206

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 },
issue_date = { December 2012 },
volume = { 60 },
number = { 10 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume60/number10/9731-4206/ },
doi = { 10.5120/9731-4206 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:06:14.866615+05:30
%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î
%J International Journal of Computer Applications
%@ 0975-8887
%V 60
%N 10
%P 37-40
%D 2012
%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
  1. 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.
  2. Lawson, Mark V. (2004). Finite automata. Chapman and Hall/CRC. ISBN 1-58488-255-7. Zbl 1086. 68074.
  3. McCulloch, W. S. ; Pitts, E. (1943). "A logical cal-culus of the ideas imminent in nervous activity". Bulletin of Mathematical Biophysics: 541–544.
  4. Rabin, M. O. ; Scott, D. (1959). "Finite automata and their decision problems. ". IBM J. Res. Develop. : 114–125.
  5. 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.
  6. 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
  7. C. Allauzen and M. Mohri, Finitely subsequential transducers, International J. Foundations Comp. Sci. 14 (2003), 983-994
  8. M. -P. Béal and O. Carton, Determinization of trans-ducers over finite and infinite words, Theoret. Comput. Sci. 289 (2002), 225-251
  9. Bruggemann-Klein, Regular expressions into finite automata, Lecture Notes in Computer Science 583 (1992), 87-98
  10. J. Carroll and D. Long, Theory of Finite Automata, Prentice-Hall, Englewood Cliffs, NJ, 1989.
  11. M. V. Lawson, Finite Automata, CRC Press, Boca Raton, FL, 2003.
  12. D. Perrin, Finite automata, in Handbook of Theoret-ical Computer Science, Volume B (editor J. Van Leeuwen), Elsevier, Amsterdam, 1990, 1-57.
  13. D. Perrin and J. E. Pin, Infinite Words, Elsevier, Amsterdam, 2004.
  14. Ch. Reutenauer, Subsequential functions: characte-rizations, minimization, examples, Lecture Notes in Computer Science 464 (1990), 62-79.
  15. J. Sakarovitch, Kleene's theorem revisited, Lecture Notes in Computer Science 281(1987), 39-50.
  16. E. Roche and Y. Schabes (editors), Finite-State Language Processing, The MIT Press, 1997.
  17. 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

Keywords

DFA Transition Table MOD

Powered by PhDFocusTM