More Web Proxy on the site http://driver.im/

research-article

Increasing engagement in automata theory with JFLAP

Authors:

Susan H. Rodger,

Jonathan SuAuthors Info & Claims

SIGCSE '09: Proceedings of the 40th ACM technical symposium on Computer science education

Pages 403 - 407

https://doi.org/10.1145/1508865.1509011

Published: 04 March 2009 Publication History

Abstract

We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our results the majority of students felt that having access to JFLAP made learning course concepts easier, made them feel more engaged in the course and made the course more enjoyable. We also describe changes and additions to JFLAP we have made based on feedback from users. These changes include new algorithms such as a CYK parser and a user-controlled parser, and new resources that include a JFLAP online tutorial, a wiki and a listserv.

References

[1]

E. Adar. Guess: A language and interface for graph exploration. In SIGCHI, pages 347--363, April 2006.

Digital Library

[2]

J. Barwise and J. Etchemendy. Turing's World 3.0 for the Macintosh. CSLI, Cambridge University Press, 1993.

Digital Library

[3]

D. Berque and et al. The SetPlayer System: An Overview and a User Manual. Department of Computer Science, Technical Report 91--17, Rensselaer Polytechnic Institute, Troy, New York, 1991.

[4]

J. Berry. Improving discrete mathematics and algorithms curricula with link. In ACM SIGCSE/SIGCUE Conference on Integrating Technology in Computer Science Education, 1997.

Digital Library

[5]

C. W. Brown and E. A. Hardisty. Regexex: An interactive system providing regular expression exercises. In Thirty-eighth SIGCSE Technical Symposium on Computer Science Education, page (to appear). SIGCSE, March 2007.

Digital Library

[6]

M. Brown. Exploring algorithms using balsa-ii. Computer, 21(2):14--36, May 1988.

Digital Library

[7]

J. Cogliati, F. Goosey, M. Grinder, B. Pascoe, R. Ross, and C. Williams. Realizing the promise of visualization in the theory of computing. JERIC, 5, 2005.

Digital Library

[8]

P. Gloor. Aace - algorithm animation for computer science education. In Proceedings of the 1992 IEEE Workshop on Visual Languages, pages 25--31, 1992.

[9]

M. T. Grinder. A preliminary empirical evaluation of the effectiveness of a finite state automaton animator. In Thirty-fourth SIGCSE Technical Symposium on Computer Science Education, pages 157--161. SIGCSE, February 2003.

Digital Library

[10]

C. Hundhausen, S. Douglas, and J. Stasko. A meta-study of algorithm visualization effectiveness. Journal of Visual Languages and Computing, 13(3):259--290, 2002.

[11]

J. Jarvis and J. Lucas. Incorporating transformations into jflap for enhanced understanding of automata. In Thirty-ninth SIGCSE Technical Symposium on Computer Science Education, pages 14--18. SIGCSE, March 2008.

Digital Library

[12]

P. Linz. An Introduction to Formal Languages and Automata, 4th Edition. Jones and Bartlett, Sudbury, MA, 2006.

Digital Library

[13]

T. Naps. Jhave: Supporting algorithm visualization. IEEE Computer Graphics, 25:49--55, 2005.

Digital Library

[14]

T. Naps, G. Rossling, V. Almstrum, W. Dann, R. Fleischer, C. Hundhausen, A. Korhonen, L. Malmi, M. McNally, S. Rodger, and J. A. Velazquez-Iturbide. Exploring the role of visualization and engagement in computer science education, report of the working group on improving the educational impact of algorithm visualization, 2002. ITICSE.

Digital Library

[15]

S. Pemmaraju and S. Skiena. Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica. Cambridge University Press, 2003.

Digital Library

[16]

S. Rodger, J. Lim, and S. Reading. Increasing interaction and support in the formal languages and automata theory course. In The Twelfth Annual Conference on Innovation and Technology in Computer Science Education, pages 379--383. ITICSE, June 2007.

Digital Library

[17]

S. H. Rodger. Jflap web site, 2008. www.jflap.org.

[18]

S. H. Rodger and T. W. Finley. JFLAP -- An Interactive Formal Languages and Automata Package. Jones and Bartlett, Sudbury, MA, 2006.

Digital Library

[19]

G. Roessling and B. Freisleben. Animalscript: An extensible scripting language for algorithm animation. In Twenty-second SIGCSE Technical Symposium on Computer Science Education, pages 70--74, Feb 2001.

Digital Library

[20]

S. Skiena. Implementing Discrete Mathematics. Addison Wesley, Redwood City, CA, 1990.

Digital Library

[21]

J. Stasko. Tango: A framework and system for algorithm animation. IEEE Computer, pages 27--39, Sept 1990.

Digital Library

[22]

J. Stasko. Using student--built algorithm animations as learning aids. In Twenty-eighth SIGCSE Technical Symposium on Computer Science Education, pages 25--29, March 1997.

Digital Library

[23]

J. Stasko and A. Lawrence. Empirically assessing algorithm animations as learning aids. In Software Visualization, pages 419--438. MIT Press, 1998.

[24]

A. Stoughton. Experimenting with formal languages. In Thirty-sixth SIGCSE Technical Symposium on Computer Science Education, page 566. SIGCSE, February 2005.

[25]

R. Taylor. Models of Computation and Formal Languages. Oxford University Press, New York, 1998.

Digital Library

[26]

L. F. M. Vieira, M. A. M. Vieira, and N. J. Vieira. Language emulator, a helpful toolkit in the learning process of computer theory. In Thirty-fifth SIGCSE Technical Symposium on Computer Science Education, pages 135--139. SIGCSE, March 2004.

Digital Library

[27]

T. M. White and T. P. Way. jfast: A java finite automata simulator. In Thirty-seventh SIGCSE Technical Symposium on Computer Science Education, pages 384--388. SIGCSE, March 2006.

Digital Library

Cited By

Robson ERuggerio SErickson JMonga MLonati VBarendsen ESheard JPaterson J(2024)FSM Builder: A Tool for Writing Autograded Finite Automata QuestionsProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653599(269-275)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653599
Marchetti KSevaljevic ADiviney AEardley CPhillips RKhadka RIgbokwe DBodily PMonga MLonati VBarendsen ESheard JPaterson J(2024)Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completenessProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653544(255-261)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653544
Mohammed MA. Shaffer CStephenson BStone JBattestilli LRebelsky SShoop L(2024)Teaching Formal Languages through Programmed InstructionProceedings of the 55th ACM Technical Symposium on Computer Science Education V. 110.1145/3626252.3630940(867-873)Online publication date: 7-Mar-2024
https://dl.acm.org/doi/10.1145/3626252.3630940
Show More Cited By

Index Terms

Increasing engagement in automata theory with JFLAP
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Visual languages
    2. Formal language definitions
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Learning automata and formal languages interactively with JFLAP
ITICSE '06: Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
A visual and interactive automata theory course with JFLAP 4.0
SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education

We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters worth of material from JFLAP 3.1, now covering topics from eleven of ...
Increasing engagement in automata theory with JFLAP
SIGCSE '09

We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our results the majority of students felt that having access to JFLAP made learning ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCSE '09: Proceedings of the 40th ACM technical symposium on Computer science education

March 2009

612 pages

ISBN:9781605581835

DOI:10.1145/1508865

General Chairs:
Sue Fitzgerald
Metropolitan State University
,
Mark Guzdial
Georgia Institute of Technology
,
Program Chairs:
Gary Lewandowski
Xavier University
,
Steven Wolfman
University of British Columbia

ACM SIGCSE Bulletin Volume 41, Issue 1
SIGCSE '09
March 2009
553 pages
ISSN:0097-8418
DOI:10.1145/1539024
Issue’s Table of Contents

Copyright © 2009 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCSE09

Sponsor:

SIGCSE09: The 40th ACM Technical Symposium on Computer Science Education

March 4 - 7, 2009

TN, Chattanooga, USA

Acceptance Rates

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE TS 2025

Sponsor:
sigcse

The 56th ACM Technical Symposium on Computer Science Education

February 26 - March 1, 2025

Pittsburgh , PA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
402
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)4

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Robson ERuggerio SErickson JMonga MLonati VBarendsen ESheard JPaterson J(2024)FSM Builder: A Tool for Writing Autograded Finite Automata QuestionsProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653599(269-275)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653599
Marchetti KSevaljevic ADiviney AEardley CPhillips RKhadka RIgbokwe DBodily PMonga MLonati VBarendsen ESheard JPaterson J(2024)Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completenessProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653544(255-261)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653544
Mohammed MA. Shaffer CStephenson BStone JBattestilli LRebelsky SShoop L(2024)Teaching Formal Languages through Programmed InstructionProceedings of the 55th ACM Technical Symposium on Computer Science Education V. 110.1145/3626252.3630940(867-873)Online publication date: 7-Mar-2024
https://dl.acm.org/doi/10.1145/3626252.3630940
Zhang GVerlan SWu TCabarle FXue JOrellana-Martín DDong JValencia-Cabrera LPérez-Jiménez MZhang GVerlan SWu TCabarle FXue JOrellana-Martín DDong JValencia-Cabrera LPérez-Jiménez M(2024)Software Simulations of Spiking Neural P SystemsSpiking Neural P Systems10.1007/978-981-97-9282-5_11(317-376)Online publication date: 24-Sep-2024
https://doi.org/10.1007/978-981-97-9282-5_11
Patil PChaudhary NPrasad SBhandwal MArora MSingh G(2023)Predicting Student Performance with Machine Learning Algorithms2023 3rd International Conference on Technological Advancements in Computational Sciences (ICTACS)10.1109/ICTACS59847.2023.10390077(1346-1353)Online publication date: 1-Nov-2023
https://doi.org/10.1109/ICTACS59847.2023.10390077
Jordaan STimm NMarshall L(2023)AutomaTutor: An Educational Mobile App for Teaching Automata TheoryFormal Methods: Foundations and Applications10.1007/978-3-031-49342-3_8(131-140)Online publication date: 2-Dec-2023
https://doi.org/10.1007/978-3-031-49342-3_8
Brunelle NEvans DMerkle LDoyle MSheard JSoh LDorn B(2022)Comfortable Cohorts and Tractable TeamsProceedings of the 53rd ACM Technical Symposium on Computer Science Education - Volume 110.1145/3478431.3499353(717-723)Online publication date: 22-Feb-2022
https://dl.acm.org/doi/10.1145/3478431.3499353
Mohammed MShaffer CRodger SSherriff MMerkle LCutter PMonge ASheard J(2021)Teaching Formal Languages with Visualizations and Auto-Graded ExercisesProceedings of the 52nd ACM Technical Symposium on Computer Science Education10.1145/3408877.3432398(569-575)Online publication date: 3-Mar-2021
https://dl.acm.org/doi/10.1145/3408877.3432398
Jovanović NMiljković DStamenković SJovanović ZChakraborty P(2020)Teaching concepts related to finite automata using ComVisComputer Applications in Engineering Education10.1002/cae.2235329:5(994-1006)Online publication date: 19-Oct-2020
https://doi.org/10.1002/cae.22353
Stamenković SJovanović NChakraborty P(2020)Evaluation of simulation systems suitable for teaching compiler construction coursesComputer Applications in Engineering Education10.1002/cae.2223128:3(606-625)Online publication date: 31-Mar-2020
https://doi.org/10.1002/cae.22231
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.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents