Animating automata: a cross-platform program for teaching finite automata

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.

REFERENCES

• 1: 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.
• 2: Christopher M. Boroni , Frances W. Goosey , Michael T. Grinder , Rockford J. Ross, A paradigm shift! The Internet, the Web, browsers, Java and the future of computer science education, Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, p.145-152, February 26-March 01, 1998, Atlanta, Georgia, United States
• 3: Christopher M. Boroni , Frances W. Goosey , Michael T. Grinder , Rockford J. Ross, Engaging students with active learning resources: hypertextbooks for the web, Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, p.65-69, February 2001, Charlotte, North Carolina, United States
• 4: Rockford J. Ross , Christopher M. Boroni , Frances W. Goosey , Michael Grinder , Paul Wissenbach, WebLab! A universal and interactive teaching, learning, and laboratory environment for the World Wide Web, Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education, p.199-203, February 27-March 01, 1997, San Jose, California, United States
• 5: Frederick P. Brooks, Jr., The Mythical Man-Month: Essays on Softw, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1978
• 6: Eric Gramond , Susan H. Rodger, Using JFLAP to interact with theorems in automata theory, The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, p.336-340, March 24-28, 1999, New Orleans, Louisiana, United States
• 7: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 8: 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.
• 9: 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.
• 10: Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
• 11: 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.
• 12: Mayer, R. E., and Gallini, J. K. When is an illustration worth ten thousand words? Journal of Educational Psychology 82, 4(1990), 715-726.
• 13: Matthew B. Robinson , Jason A. Hamshar , Jorge E. Novillo , Andrew T. Duchowski, A Java-based tool for reasoning about models of computation through simulating finite automata and Turing machines, The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, p.105-109, March 24-28, 1999, New Orleans, Louisiana, United States