article

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

Author:

Michael T. GrinderAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 34, Issue 1

Pages 63 - 67

https://doi.org/10.1145/563517.563364

Published: 27 February 2002 Publication History

Get Access

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.

Google Scholar

[2]

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.

Digital Library

Google Scholar

[3]

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.

Digital Library

Google Scholar

[4]

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.

Digital Library

Google Scholar

[5]

Brooks, Jr, F. P. The Mythical Man-Month: Essays on Software Engineering Addison-Wesley, 1982.

Digital Library

Google Scholar

[6]

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.

Digital Library

Google Scholar

[7]

Hopcroft, J. E., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[10]

Lewis, H. R., and Papadimitriou, C. H. Elements of the Theory of Computatioin. Prentice-Hall, 1981.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[13]

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.

Digital Library

Google Scholar

Cited By

View all

Bruel JEbersold SGalinier FMazzara MNaumchev AMeyer B(2021)The Role of Formalism in System RequirementsACM Computing Surveys10.1145/344897554:5(1-36)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1145/3448975
Tecson CRodrigo M(2018)Tutoring Environment for Automata and the Users' Achievement Goal Orientations2018 IEEE International Conference on Teaching, Assessment, and Learning for Engineering (TALE)10.1109/TALE.2018.8615234(526-533)Online publication date: Dec-2018
https://doi.org/10.1109/TALE.2018.8615234
Ade-Ibijola A(2018)Synthesis of regular expression problems and solutionsInternational Journal of Computers and Applications10.1080/1206212X.2018.148239842:8(748-764)Online publication date: 28-Jun-2018
https://doi.org/10.1080/1206212X.2018.1482398
Show More Cited By

Animating automata: a cross-platform program for teaching finite automata
1. Theory of computation

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
SIGCSE '02: Proceedings of the 33rd SIGCSE technical symposium on Computer science education

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 ...
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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 34, Issue 1

Inroads: paving the way towards excellence in computing education

March 2002

417 pages

ISSN:0097-8418

DOI:10.1145/563517

Issue’s Table of Contents

SIGCSE '02: Proceedings of the 33rd SIGCSE technical symposium on Computer science education
February 2002
471 pages
ISBN:1581134738
DOI:10.1145/563340
Conference Chairs:
Judith Gersting
University of Hawaii at Hilo
,
Henry M. Walker
Grinnell College
,
Program Chair:
Scott Grissom
Grand Valley State University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2002

Published in SIGCSE Volume 34, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
476
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bruel JEbersold SGalinier FMazzara MNaumchev AMeyer B(2021)The Role of Formalism in System RequirementsACM Computing Surveys10.1145/344897554:5(1-36)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1145/3448975
Tecson CRodrigo M(2018)Tutoring Environment for Automata and the Users' Achievement Goal Orientations2018 IEEE International Conference on Teaching, Assessment, and Learning for Engineering (TALE)10.1109/TALE.2018.8615234(526-533)Online publication date: Dec-2018
https://doi.org/10.1109/TALE.2018.8615234
Ade-Ibijola A(2018)Synthesis of regular expression problems and solutionsInternational Journal of Computers and Applications10.1080/1206212X.2018.148239842:8(748-764)Online publication date: 28-Jun-2018
https://doi.org/10.1080/1206212X.2018.1482398
Rocha JOlivete CGomes PGarcia RCorreia Rde Souza GEler D(2018)Internet-Based Education: A New Milestone for Formal Language and Automata CoursesInformation Technology – New Generations10.1007/978-3-319-77028-4_28(195-200)Online publication date: 2018
https://doi.org/10.1007/978-3-319-77028-4_28
Chakraborty PSaxena PKatti C(2011)Fifty years of automata simulationACM Inroads10.1145/2038876.20388932:4(59-70)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1145/2038876.2038893
Juve GDeelman E(2010)Scientific workflows and cloudsXRDS: Crossroads, The ACM Magazine for Students10.1145/1734160.173416616:3(14-18)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1734160.1734166
Chakraborty PSaxena PKatti C(2010)A compiler‐based toolkit to teach and learn finite automataComputer Applications in Engineering Education10.1002/cae.2049221:3(467-474)Online publication date: 13-Oct-2010
https://doi.org/10.1002/cae.20492
Christen P(2009)Development and user experiences of an open source data cleaning, deduplication and record linkage systemACM SIGKDD Explorations Newsletter10.1145/1656274.165628211:1(39-48)Online publication date: 16-Nov-2009
https://dl.acm.org/doi/10.1145/1656274.1656282
Guazzelli AStathatos KZeller M(2009)Efficient deployment of predictive analytics through open standards and cloud computingACM SIGKDD Explorations Newsletter10.1145/1656274.165628111:1(32-38)Online publication date: 16-Nov-2009
https://dl.acm.org/doi/10.1145/1656274.1656281
Armoni MBen-Ari M(2009)The concept of nondeterminismACM SIGCSE Bulletin10.1145/1595453.159549541:2(141-160)Online publication date: 25-Jun-2009
https://dl.acm.org/doi/10.1145/1595453.1595495
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

On stateless multihead automata: Hierarchies and the emptiness problem

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

Interrupt Timed Automata: verification and expressiveness