Fifty years of automata simulation: a review

@article{Chakraborty2011FiftyYO,
  title={Fifty years of automata simulation: a review},
  author={Pinaki Chakraborty and Prem Chandra Saxena and Chittaranjan Padmanabha Katti},
  journal={Inroads},
  year={2011},
  volume={2},
  pages={59-70}
}
Automata theory is an important subject in computer science and quite consequently, simulation of automata for pedagogical purposes is an important topic in computer science education research. This article reviews the major initiatives in the field of simulation of automata in the last five decades with emphasis on those automata simulators actually used at universities for teaching. A classification of the automata simulators on the basis of their design paradigms has been developed where… 

Figures from this paper

Didactic Strategy for Learning Theory of Automata & Formal Languages:
TLDR
A didactic strategy to simplify the hardness of the courses on formal languages and automata theory and aids to increase the interest and commitment of students in these courses are presented.
Automata Simulator: A mobile app to teach theory of computation
TLDR
A mobile app named Automata Simulator was developed to simulate different types of automata and used to teach the course on theory of computation, and a more sophisticated desktop application, JFLAP, was used to study advanced concepts related to automata theory after the lectures.
A Compiler Technology Based Approach to Simulation of Basic Forms of Automata
TLDR
This dissertation formalizes a comprehensive approach based on compiler technology to simulate some basic forms of automata viz., finite accepters, finite transducers, pushdown accePters and Turing machines and proposes a toolkit to add utility to the Automata Description Language.
Tutoring Environment for Automata and the Users' Achievement Goal Orientations
  • Cesar A. Tecson, M. Rodrigo
  • Computer Science, Education
    2018 IEEE International Conference on Teaching, Assessment, and Learning for Engineering (TALE)
  • 2018
TLDR
This study presents the appeal of the developed tutoring system for automata, ILSA, to the different achievement goal orientations of learners.
ComVIS—Interactive simulation environment for compiler learning
TLDR
A software system for visualization and simulation of basic compiler concepts and algorithms, capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table.
JFLAP Extensions for Instructors and Students
TLDR
Two kinds of enhancements to JFLAP's capabilities with regards to finite automata are presented, which provide instructors with the ability to understand difficulties faced by students on an individual and collective basis by tracking student progress as they solve automata construction problems, and offer students a simple and intuitive means to specify correctness of their automata constructions.
An Introduction of Theory of Computation
TLDR
This paper is presenting an introduction of theory of computation, a part of mathematics and computer science, which can be divided into the following three areas: Complexity Theory, Computability Theory, and Automata Theory.
Generating Efficient Techniques for Information Extraction and Processing Using Cellular Automata
TLDR
This chapter initiate with basic literature on cellular automata, related definitions and notations and focuses on its applications in information processing.
Enhancing JFLAP with automata construction problems and automated feedback
TLDR
The quality of JFLAP's interactivity is enhanced in two ways that are extremely useful for beginners learning to build finite automata: (1) the tool can automatically generate a rich variety of practice problems and immediately evaluate student answers and (2) a novel way for students to obtain prompt and meaningful feedback on their solutions to problems taken from other sources such as assignments or textbooks.
Simulations of Quantum Finite Automata
TLDR
A Python library to simulate different kinds of quantum finite automata on a classical computer and provides tools for language generation and visual representation of simulation results is presented.
...
1
2
3
4
...

References

SHOWING 1-10 OF 64 REFERENCES
Automata simulator
TLDR
The main purpose of this article is to propose key features and requirements of well designed automata simulator and to present the tool SimStudio -- integrated simulator of finite automaton, pushdown Automaton, Turing machine, RAM with extension and abacus machine.
Automata: a teaching aid for mathematical machines
TLDR
A practical programming language specially designed to aid teachers and students of Computer Science courses which deal with mathematical machines, and the motivation for developing such a language in the Computer Science curriculum.
Using theoretical computer simulators for formal languages and automata theory
TLDR
The main features of software tools currently freely available via the Internet for teaching FLAT, and general recommendations for integrating FLAT software tools into an established curriculum are discussed.
TAGS: A Software Tool for Simulating Transducer Automata
This paper introduces TAGS (Transducer Automata Graphical Simulator), a software tool for teaching different aspects of transducer automata theory, a theoretical topic which underlies many aspects of
Hypercard automata simulation: finite-state, pushdown and Turing machines
TLDR
A package of highly interactive simulation models for the concepts taught in Theory of Computing courses, using Macintosh Hypercard stacks to demonstrate the three basic automata models: Finite-State Machines, Push-Down Machines, and Turing Machines.
Animating automata: a cross-platform program for teaching finite automata
TLDR
The FSA Simulator is a Java program created to allow computer science students to experiment with finite state automata and has its own unique features.
An Abstract Machine Simulator
TLDR
This paper introduces an Abstract Machine Simulator for assisting students to learn abstract machines such as finite automata, Mealy machines and Moore machines and demonstrates the effectiveness of a multi-paradigm programming approach to the implementation of tutoring programs.
A Java-based tool for reasoning about models of computation through simulating finite automata and Turing machines
TLDR
The Java Computability Toolkit (JCT) is introduced here as a new teaching aide and as an exploratory student's supplement to a course on theory of computation.
Using JFLAP to interact with theorems in automata theory
TLDR
JFLAP is enhanced to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA.
Language emulator, a helpful toolkit in the learning process of computer theory
TLDR
Language Emulator introduces error-detecting and internationalization functionalities into automata tools in order to help undergraduate students to understand the concepts of Automata Theory.
...
1
2
3
4
5
...