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

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.