Abstract
This paper introduces an Abstract Machine Simulator (AMS) for assisting students to learn abstract machines such as finite automata, Mealy machines and Moore machines. With AMS, topics related to abstract machines which are often included in introductory courses on Theory of Computation can be mastered more easily since it allows the learner to simulate any machine s/he can think of. The program supports learning by discovery. Through interacting with a simulation, the learner can acquire indepth knowledge about the nature of the machine. The general problem-solver approach adopted in developing the program can be employed to construct other simulation and animation based CAI applications. The program also demonstrates the effectiveness of a multi-paradigm programming approach to the implementation of tutoring programs.
Preview
Unable to display preview. Download preview PDF.
References
Cohen D.I.A. Introduction to Computer Theory. John Wiley & Sons, Inc., 1986.
Kearsley G. Authoring Systems in Computer Based Education. Communication of the ACM, 25(7), 429–437, 1982.
Hopcroft J.E. & Ullman J.D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London, 1979.
Lee M.C. ICAI Authoring System Development — a multi-paradigm approach. Doctoral Thesis, University of London, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, M.C. (1990). An abstract machine simulator. In: Norrie, D.H., Six, HW. (eds) Computer Assisted Learning. ICCAL 1990. Lecture Notes in Computer Science, vol 438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020875
Download citation
DOI: https://doi.org/10.1007/BFb0020875
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52699-5
Online ISBN: 978-3-540-47111-0
eBook Packages: Springer Book Archive