ICCAL '90 Proceedings of the third international conference on Computer assisted learning
The analytical engine: an introduction to computer science using Hypercard
The analytical engine: an introduction to computer science using Hypercard
Complete HyperCard 2.0 Handbook
Complete HyperCard 2.0 Handbook
An Introduction to the Theory of Computation
An Introduction to the Theory of Computation
Elementary Computability, Formal Languages and Automata
Elementary Computability, Formal Languages and Automata
Theory of Computation: A Primer
Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Finite state machine simulation in an introductory lab
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
LLparse and LRparse: visual and interactive tools for parsing
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
An interactive lecture approach to teaching computer science
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Neuralis: an artificial neural network package
ITiCSE '96 Proceedings of the 1st conference on Integrating technology into computer science education
An overview of visualization: its use and design: report of the working group in visualization
ITiCSE '96 Proceedings of the 1st conference on Integrating technology into computer science education
A collection of tools for making automata theory and formal languages come alive
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Grail: a C++ library for finite-state machines and regular expressions
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
A visual and interactive automata theory course with JFLAP 4.0
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Fifty years of automata simulation: a review
ACM Inroads
| Hi-index | 0.00 |
This paper describes a package of highly interactive simulation models for the concepts taught in Theory of Computing courses. Macintosh Hypercard stacks are used to demonstrate the three basic automata models: Finite-State Machines, Push-Down Machines, and Turing Machines. These simulations feature multiple named machines on the same stack, accessible via a customized menu or buttons on the screen. Because of the scripts hidden behind the visible screen, with just a click of a butto students can alter starting states, the set of input symbols, the number of states, the finality of states, or the action based on a given state/input combination. These simulations have been successfully used in conjunction with a course on the Theory of Computing at Union College since 1989. Students have responded enthusiastically to this concrete method of teaching abstract concepts.