Premium
Teaching concepts related to finite automata using ComVis
Author(s) -
Jovanović Nenad,
Miljković Dragiša,
Stamenković Srećko,
Jovanović Zoran,
Chakraborty Pinaki
Publication year - 2021
Publication title -
computer applications in engineering education
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.478
H-Index - 29
eISSN - 1099-0542
pISSN - 1061-3773
DOI - 10.1002/cae.22353
Subject(s) - nondeterministic finite automaton , computer science , nondeterministic algorithm , deterministic finite automaton , finite state machine , regular expression , two way deterministic finite automaton , state diagram , theoretical computer science , automaton , software , deterministic automaton , programming language , automata theory , visualization , process (computing) , artificial intelligence
This paper describes educational software for visualization and finite automata simulation. The system was developed in Java programming language, and its main purpose is learning process improvement. Using this software, finite automata can be defined in a graphical editor in the form of a state diagram, or by defining the transition function using the transition table. Upon defining an automaton, it is possible to run a visual simulation of the automaton operation for an arbitrary input string, whereby a textual description of the automaton simulation is also obtained. Furthermore, the system allows for conversion of regular expressions to deterministic finite automata and nondeterministic finite automata. The simulation of Thompson's construction algorithm is implemented, so that transformation of a regular expression to the corresponding NFA can be monitored in a step‐by‐step process. The quantitative analysis and evaluation of the effectiveness of the simulator are based on a survey of undergraduate students at two universities. The majority of students found the tool a useful means for better understanding and mastering of finite automata concepts.