Simulate a Deterministic Finite State Automata (DFA) Using Java Program

Authors

  • Fatma Abdulqadir Karkouri Higher Institute of Refrigeration and Air Conditioning Sokna,Libya
  • Meftah Omar Bashir The Higher Institute Of Refrigeration And Air Conditioning Sokna-libya

Keywords:

FA, DFA, NDFA, RE, Thompson’s Algorithm

Abstract

Finite automata are computing devices that accept/recognize regular languages and are used to model operations of many systems find in practice. Their operations can be simulated by a very simple computer program. Automata simulators are pedagogical tools used to teach, learn and research automata theory. An automata simulator takes as input the description of an automaton and then simulates its working for an arbitrary input string. The description of the automaton can be entered in several ways. An automaton can be defined in a symbolic language or its specification may be entered in a predesigned form or its transition diagram may be drawn by clicking and dragging the mouse. Well known automata simulators include Turing’s World, JFLAP, VAS, TAGS and Sim Studio. This paper is to simulate a Deterministic Finite State Automata (DFA) using java program. Deterministic Finite State Automata (DFA) is one of the two types of Finite Automata. The program reads a description of the DFA from the files that introduced in last section of this paper. At the end of execution, information about whether or not the input string was accepted or rejected.

Cite this Article

Fatma A. Karkouri, Meftah. O. Bashir. Simulate a Deterministic Finite State Automata (DFA) Using Java Program. Journal of Computer Technology & Applications. 2018; 9(3): 17–23p.

References

Automata Theory: https://en.wikipedia.org/wiki/Automata_theory, From Wikipedia, 12 July 2017

Ezhilarasu, Krishnaraj, Suresh Babu, Applications of Finite Automata in Text Search – A Review, IJCSET (www.ijcset.ne

t), May 2015; 5(5): 116–119p.

Ngassam EK, Kourie DG, Watson BW. Reordering finite automatata states for fast string recognition. In J. Holub and M. ˇSim´anek, editors, Proceedings of the Prague Stringology Conference ’05, Czech Technical University in Prague, Czech Republic, 2005, 69–80p.

Ngassam EK, Kourie DG, Watson BW. On implementation and performance of table-driven DFA-based string processors. In J. Holub and J. ˇZˇd´arek, editors, Proceedings of the Prague Stringology Conference ’06, Czech Technical University in Prague, Czech Republic, 2006, 108–122p.

Thompson K. Regular expression search algorithm. Commun ACM. 1968; 11: 419–422p.

Available at: https://www.tutorialspoint.com/automata_theory/automata_theory_introduction.htm,by Prof. Arnab Chakraborty, Published on: on 13th Dec, 2017

Available at: http://www.devdaily.com/java/edu/pj/pj010017/index.shtml, By Alvin Alexander. Last updated: March 13 2018

Reinhard Wilhelm, Dieter Maurer, Compiler Design, Addison-Wesley Publishing Company, 1995.

Robin Hunter, The Essence of Compilers, Prentice Hall, 1999.

Downloads

Published

2019-02-04

Issue

Vol. 9 No. 3 (2018)

Section

Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.