Search
1 article for “Thompson’s Algorithm”
-
Simulate a Deterministic Finite State Automata (DFA) Using Java Program
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 …
Published in Journal of Computer Technology & Applications · Vol. 9, Issue 3, 2018 · pp. 17–23 Read article