A visual and interactive automata theory course with JFLAP 4.0

SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

Volumn 36, Issue 1, 2004, Pages 140-144

  Cavalcante, Ryan ^a   Finley, Thomas ^b   Rodger, Susan H ^a  

^a Duke University   (United States)

^b School of Operations Research and Information Engineering   (United States)

Author keywords

Automata; Grammar; JFLAP; L system; LL parsing; Pushdown automata; SLR parsing; Turing machine

Indexed keywords

AUTOMATA THEORY COURSE; JFLAP; L-SYSTEM; LL PARSING; PUSHDOWN AUTOMATA; SLR PARSING;

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER SOFTWARE; FORMAL LANGUAGES; INTERACTIVE COMPUTER SYSTEMS; SYSTEMS ANALYSIS; TURING MACHINES;

AUTOMATA THEORY;

EID: 33646847655     PISSN: 00978418     EISSN: 00978418     Source Type: Conference Proceeding    
DOI: 10.1145/1028174.971349     Document Type: Conference Paper

References (11)

1. J. Barwise and J. Etchemendy. Turing's World 3.0 for the Macintosh. CSLI, Cambridge University Press, 1993.
2. A. O. Bilska, K. H. Leider, M. Procopiuc, O. Procopiuc, S. H. Rodger, J. R. Salemme, and E. Tsang. A collection of tools for making automata theory and formal languages come alive. In Twenty-eighth SIGCSE Technical Symposium on Computer Science Education, pages 15-19. SIGCSE, March 1997.
3. C. Boroni, F. Goosey, M. Grinder, and R. Ross. Engaging students with active learning resources: Hypertextbooks for the web. In Thirty-second SIGCSE Technical Symposium on Computer Science Education, pages 65-69. SIGCSE, February 2001.
4. D. Hannay. Hypercard automata simulation: Finite state, pushdown and turing machines. SIGCSE Bulletin, 24(2):55-58, June 1992.
5. T. Hung and S. H. Rodger. Increasing visualization and interaction in the automata theory course. In Thirty-first SIGCSE Technical Symposium on Computer Science Education, pages 6-10. SIGCSE, March 2000.
6. P. Linz. An Introduction to Formal Languages and Automata, 3rd Edition. Jones and Bartlett, Sudbury, MA, 2001.
7. P. Prusinkiewicz and A. Lindenmayer. The Algorithmic Beauty of Plants. Springer-Verlag, New York, 1990.
8. S. H. Rodger. Jflap web site, 2003. www.cs.duke.edu/~rodger/tools/.
9. M. Stallman, R. Cleaveland, and P. Hebbar. Gdr: A visualization tool for graph algorithms. In Proceedings of Computational Support for Discrete Mathematics, pages 17-28. American Mathematical Society, 1994.
10. K. Sutner. Implementing finite state machines. In DIM ACS Workshop on Computational Support for Discrete Mathematics, pages 347-363. DIMACS, March 1992.
11. R. Taylor. Models of Computation and Formal Languages. Oxford University Press, New York, 1998.