|
Animating Finite State Automataa component ofAnimating the Theory of Computinga primary thrust of theWebworks Laboratory
Animating the Theory of ComputingDeveloping the tools necessary for animating the theory of computing is perhaps the most ambitious project of the Webworks Laboratory. It is our goal to provide the tools necessary for a "hypertextbook" on the theory of computing that allows students to explore computing theory through interactive animations. The eventual objective is to provide an environment in which students can learn even the deeper aspects of the theory, such as NP-completeness.The CraftsmanWebworks team member Michael Grinder is the lead person on this project. His PhD thesis is on animating the theory of computing. His first module is a finite state automaton animator, upon which he will be able to build all of the other necessary models of computation. The FSA animator has been used very successfully in sophomore level courses, the freshman theory course, the senior compiler course, and the graduate theory course. It has also been featured an a number of educational conferences, including SIGCSE.FeaturesThere are a number of features in the animator.
While the finite state automaton animator is very flexible, this version does not allow a student to save examples constructed from with in the animator. Saving from an applet was simply not allowed (for security reasons) until the most recent versions of the Java Virtual Machine. The capability to save constructed finite state automata is just now being added as a new feature.The FSA AnimatorClick here to try it for yourself! Remember to do the following:
|