Understanding the Universal Turing Machine: an implementation in JFLAP

Authors:
Jonathan Jarvis;Joan M. Lucas
Affiliations:
Advanced Micro Devices M/S 521, Austin, TX;State University of New York, College at Brockport Brockport, NY
Venue:
Journal of Computing Sciences in Colleges
Year:
2008

Citing 5
Cited 0

Turning automata theory into a hands-on course

Proceedings of the 37th SIGCSE technical symposium on Computer science education
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
JFLAP: An Interactive Formal Languages and Automata Package

JFLAP: An Interactive Formal Languages and Automata Package
An Introduction to Formal Language and Automata

An Introduction to Formal Language and Automata
Incorporating transformations into jflap for enhanced understanding of automata

Proceedings of the 39th SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the implementation of a Universal Turing Machine for the JFLAP platform. JFLAP is most successful and widely used tool for visualizing and simulating automata such as finite state machines, pushdown automata, and Turing Machines. By executing our Universal Turing Machine in JFLAP, students get a direct and interactive experience of how this Turing Machine is capable of emulating other Turing Machines.