Michael T. Grinder
ABSTRACT
The FSA Simulator is a Java program created to allow computer science students to experiment with finite state automata. The program is able to simulate both deterministic and nondeterministic automata. Pre-defined automata can be loaded from files or students can create their own. Although this project is similar to others, it has its own unique features. The development history, features, and future plans for this program are discussed.
- Badre, A., Beranek, M., Morris, J. M., and Stasko, J. Assessing program visualization systems as instructional aids. Tech. Rep. GIT-GVU-91-23, Georgia Institute of Technology, Atlanta, GA, October 1991.Google Scholar
- Boroni, C. M., Goosey, F. W., Grinder, M. T., and Ross, R. J. A paradigm shift! the internet, the web, browsers, java, and the future of computer science education. In The Proceedings of the Twenty-ninth SIGCSE Technical Symposium on Computer Science Education (March 1998), vol. 30, pp. 145-152. Google ScholarDigital Library
- Boroni, C. M., Goosey, F. W., Grinder, M. T., and Ross, R. J. Engaging students with active learning resources: Hypertextbooks for the web. In The Proceedings of the Thirty-second SIGCSE Technical Symposium on Computer Science Education (March 2001), vol. 33, pp. 65-70. Google ScholarDigital Library
- Boroni, C. M., Goosey, F. W., Grinder, M. T., Ross, R. J., and Wissenbach, P. Weblab! a univeral and interactive teaching, learning and laboratory environment for the world wide web. In The Proceedings of the Twenty-Eighth SIGCSE Technical Symposium on Computer Science Education (March 1997), vol. 29, pp. 199-203. Google ScholarDigital Library
- Brooks, Jr, F. P. The Mythical Man-Month: Essays on Software Engineering Addison-Wesley, 1982. Google ScholarDigital Library
- Gramond, E., and Rodger, S. H. Using JFLAP to interact with theorems in automata theory. In Thirtieth SIGCSE Technical Symposium on Computer Science Education (1999), pp. 336-340. Google ScholarDigital Library
- Hopcroft, J. E., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. Google ScholarDigital Library
- Kehoe, C. M., and Stasko, J. T. Using animations to learn about algorithms: An ethnographic case study. Tech. Rep. GIT-GVU-96-20, Georgia Institute of Technology, Atlanta, GA, September 1996.Google Scholar
- Kehoe, C. M., Stasko, J. T., and Taylor, A. Rethinking the evaluation of algorithm animations as learning aids: An observational study. Tech. Rep. GIT-GVU-99-10, Georgia Institute of Technology, Atlanta, GA, March 1999.Google Scholar
- Lewis, H. R., and Papadimitriou, C. H. Elements of the Theory of Computatioin. Prentice-Hall, 1981. Google ScholarDigital Library
- Mayer, R. E., and Anderson, R. B. Animations need narrations: An experimental test of a dual-coding hypothesis. Journal of Educational Psychology 83, 4(1991), 484 - 490.Google ScholarCross Ref
- Mayer, R. E., and Gallini, J. K. When is an illustration worth ten thousand words? Journal of Educational Psychology 82, 4(1990), 715-726.Google ScholarCross Ref
- Robinson, M. B., Hamshar, J. A., Novillo, J. E., and Duchowski, A. T. A java-based tool for reasoning about models of computation through simulating finite automata and turing machines. In Thirtieth SIGCSE Technical Symposium on Computer Science Education (1999), pp. 105-109. Google ScholarDigital Library
- Animating automata: a cross-platform program for teaching finite automata
Recommendations
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Animating automata: a cross-platform program for teaching finite automata
Inroads: paving the way towards excellence in computing educationThe FSA Simulator is a Java program created to allow computer science students to experiment with finite state automata. The program is able to simulate both deterministic and nondeterministic automata. Pre-defined automata can be loaded from files or ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Comments