The week's pick
Random Articles
Reseach Article
Simplifying Designing Techniques: To Design DFA that Accept Strings over h={ a, b} Having at least x Number of a and y Number of b
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 91 - Number 7 |
| Year of Publication: 2014 |
| Authors: Danish Ather, Raghuraj Singh, Vinodani Katiyar |
10.5120/15891-4841
|
Danish Ather, Raghuraj Singh, Vinodani Katiyar . Simplifying Designing Techniques: To Design DFA that Accept Strings over h={ a, b} Having at least x Number of a and y Number of b. International Journal of Computer Applications. 91, 7 ( April 2014), 12-17. DOI=10.5120/15891-4841
Abstract
Being a faculty of Theory of computation it had been observed by me that students face difficulty while designing different DFA. It is always being an issue for the students to understand. This paper present an easy way of learning and designing a Deterministic finite automata that accept strings over input symbol {a, b} having atleast x number of a & y number of b. Objective of the research is to make the method of teaching learning easier , simpler and understandable for students . In this paper we develop an algorithm to design finite automata that accepts strings of input {a, b} having atleast x number of a & y number of b .
References
- 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". IJCA- Foundation of Computer Science U. S. A Volume 60 - Number 10 December 2012.
- Danish Ather, Raghuraj Singh, Vinodani Katiyar. An Efficient Algorithm to Design DFA That Accept Strings Over Input Symbol a, b Having exactly x Number of a & y Number of b. in IEEE Catalogue Number: CFP1362U-CDR, March,2013
- Danish Ather, Raghuraj Singh, Vinodani Katiyar. An Efficient Algorithm to Design DFA That Accept Strings Over Input Symbol a, b Having Atmost x Num-ber of a & y Number of b. JNIS World Science Publishers, U. S. A. Feb 2013
- 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 calculus of the ideas imminent in nervous activity". Bulletin of Mathematical Biophysics: 541–544.
- JFAP tool for simulating results and validation. [Online]. Available: http://www. jflap. org
- Deterministic finite automaton [Online] Available at ?http://www. wikipedia. org/wiki/Deterministic_finite_automaton?
Index Terms
Keywords