Increasing engagement in automata theory with JFLAP

SIGCSE Bulletin Inroads

Volumn 41, Issue 1, 2009, Pages 403-407

  Rodger, Susan H ^a   Wiebe, Eric ^b   Lee, Kyung Min ^a   Morgan, Chris ^c   Omar, Kareem ^b   Su, Jonathan ^a  

^a DUKE UNIVERSITY   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Automata; cyk parser; formal languages; jflap; pumping lemma

Indexed keywords

AUTOMATA; CYK PARSER; JFLAP; LEARNING COURSE; ONLINE TUTORIALS; PUMPING LEMMA;

FORMAL LANGUAGES; LINGUISTICS; PUMPS; ROBOTS; TEACHING; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 78651549879     PISSN: 10963936     EISSN: None     Source Type: Journal    
DOI: 10.1145/1539024.1509011     Document Type: Article

References (27)

1. E. Adar. Guess: A language and interface for graph exploration. In SIGCHI, pages 347-363, April 2006.
2. J. Barwise and J. Etchemendy. Turing's World 3.0 for the Macintosh. CSLI, Cambridge University Press, 1993.
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.
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.
6. M. Brown. Exploring algorithms using balsa-ii. Computer, 21(2):14-36, May 1988.
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.
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.
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.
12. P. Linz. An Introduction to Formal Languages and Automata, 4th Edition. Jones and Bartlett, Sudbury, MA, 2006.
13. T. Naps. Jhave: Supporting algorithm visualization. IEEE Computer Graphics, 25:49-55, 2005.
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.
15. S. Pemmaraju and S. Skiena. Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica. Cambridge University Press, 2003.
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.
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.
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.
20. S. Skiena. Implementing Discrete Mathematics. Addison Wesley, Redwood City, CA, 1990.
21. J. Stasko. Tango: A framework and system for algorithm animation. IEEE Computer, pages 27-39, Sept 1990.
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.
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.
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.
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.