Simulation and Testing of Deterministic Finite Automata Machine

Authors

  • B. Vayadande K Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.
  • Sheth P Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.
  • Shelke A Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.
  • Patil V Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.
  • Shevate S Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.
  • Sawakare C Dept. of Artificial Intelligence and Data Science, Vishwakarma Institute of Technology, Pune, Maharashtra, India.

DOI:

https://doi.org/10.26438/ijcse/v10i1.1317

Keywords:

HTML, CSS, jQuery, JavaScript,, Bootstrap, visualization, simulator

Abstract

This article describes a JavaScript and GUI-based visualization tool for constructing, debugging, and testing DFA that can be utilized in the automata theory classroom. In automata, DFA is an important problem. What DFA is, DFA refers to deterministic finite automata. Deterministic refers to the uniqueness of the computation. If the machine reads an input string one symbol at a time, the finite automata are termed deterministic finite automata. In DFA, there is only one path from the current state to the next state for specific input. The null move is not accepted by DFA, which means it cannot change the state without any input character. Multiple final states can be found in DFA. Like other automata visualization tools, users can edit and construct DFA by adding states and transitions and can observe transition execution by providing string input for testing. This DFA simulator allows users to construct DFA by adding states, marking any state as a final state, and also checking for string if it is valid for constructed DFA or not.

References

[1] M. T. Morazán, J. M. Schappel, and S. Mahashabde, “Visual designing and debugging of deterministic finite-state machines in FSM,” Electronic Proceedings in Theoretical Computer Science, vol. 321, pp. 55–77, 2020.

[2] S. H. Rodger, A. O. Bilska, K. H. Leider, M. Procopiuc, O. Procopiuc, J. R. Salemme, and E. Tsang, “A collection of tools for making automata theory and formal languages come alive,” Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education - SIGCSE `97, 1997.

[3] H. Raffelt, M. Merten, B. Steffen, and T. Margaria, “Dynamic testing via Automata Learning,” International Journal on Software Tools for Technology Transfer, vol. 11, no. 4, pp. 307–324, 2009.

[4] P. G. Naik, S. G. Patil, and G. R. Naik, “Natural language interface for querying hardware and software configuration of a local area network,” International Journal of Computer Sciences and Engineering, vol. 7, no. 2, pp. 949–963, 2019.

[5] D. Ficara, S. Giordano, G. Procissi, F. Vitucci, G. Antichi, and A. Di Pietro, “An improved DFA for fast regular expression matching,” ACM SIGCOMM Computer Communication Review, vol. 38, no. 5, pp. 29–40, 2008.

[6] Jiwei Xue, Yonggao Li and Bo Nan, "Application research of finite automaton in distance education," 2010 4th International Conference on Distance Learning and Education, 2010, pp. 129-133, doi: 10.1109/ICDLE.2010.5606024.

[7] Raza, Mir Adil, Kuldeep Baban Vayadande, and H. D. Preetham. "DJANGO MANAGEMENT OF MEDICAL STORE.", International Research Journal of Modernization in Engineering Technology and Science, Volume:02 Issue:11 November -2020

[8] K.B. Vayadande, Nikhil D. Karande,” Automatic Detection and Correction of Software Faults: A Review Paper”, International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653, Volume 8 Issue IV Apr 2020.

[9] Kuldeep Vayadande, Ritesh Pokarne, Mahalaxmi Phaldesai, Tanushri Bhuruk, Tanmai Patil, Prachi Kumar, “SIMULATION OF CONWAY’S GAME OF LIFE USING CELLULAR AUTOMATA” International Research Journal of Engineering and Technology (IRJET), Volume: 09 Issue: 01 | Jan 2022, e-ISSN: 2395-0056, p-ISSN: 2395-0072

[10] K. B. Vayadande, N. D. Karande, and S. Yadav, “A review paper on detection of moving object in dynamic background,” International Journal of Computer Sciences and Engineering, vol. 6, no. 9, pp. 877–880, 2018.

[11] Varad Ingale, Kuldeep Vayadande, Vivek Verma, Abhishek Yeole, Sahil Zawar, Zoya Jamadar. “Lexical analyzer using DFA”, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

[12] Kuldeep Vayadande, Harshwardhan More, Omkar More, Shubham Mulay, Atharva Pathak, Vishwam Talnikar, “ Pac Man: Game Development using PDA and OOP”, International Research Journal of Engineering and Technology (IRJET), Volume: 09 Issue: 01 | Jan 2022, e-ISSN: 2395-0056, p-ISSN: 2395-0072

[13] Rohit Gurav, Sakshi Suryawanshi, Parth Narkhede, Sankalp Patil, Sejal Hukare, Kuldeep Vayadande,” Universal Turing machine simulator”, International Journal of Advance Research, Ideas and Innovations in Technology, (Volume 8, Issue 1 - V8I1-1268, ISSN: 2454-132X

Downloads

Published

2022-01-31
CITATION
DOI: 10.26438/ijcse/v10i1.1317
Published: 2022-01-31

How to Cite

[1]
K. B. Vayadande, P. Sheth, A. Shelke, V. Patil, S. Shevate, and C. Sawakare, “Simulation and Testing of Deterministic Finite Automata Machine”, Int. J. Comp. Sci. Eng., vol. 10, no. 1, pp. 13–17, Jan. 2022.

Issue

Vol. 10 No. 1 (2022): IJCSE January Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.