论文信息 - A visual and interactive automata theory course with JFLAP 4.0

A visual and interactive automata theory course with JFLAP 4.0

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 thirteen chapters for a semester course. JFLAP 4.0 has easier interactive approaches to previous topics and covers many new topics including three parsing algorithms, multi-tape Turing machines, L-systems, and grammar transformations.

Susan H. Rodger | Ryan Cavalcante | Thomas Finley

[1] Rockford J. Ross,et al. Engaging students with active learning resources: hypertextbooks for the web , 2001, SIGCSE '01.

[2] David G. Hannay. Hypercard automata simulation: finite-state, pushdown and Turing machines , 1992, SGCS.

[3] Rance Cleaveland,et al. GDR: A Visualization Tool for Graph Algorithms , 1992, Computational Support for Discrete Mathematics.

[4] Przemyslaw Prusinkiewicz,et al. The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[5] Peter Linz,et al. An Introduction to Formal Languages and Automata , 2011 .

[6] Susan H. Rodger,et al. A collection of tools for making automata theory and formal languages come alive , 1997, SIGCSE '97.

[7] Klaus Sutner. Implementing Finite State Machines , 1992, Computational Support for Discrete Mathematics.

[8] Susan H. Rodger,et al. Increasing visualization and interaction in the automata theory course , 2000, SIGCSE '00.

[9] R. Gregory Taylor,et al. Models of Computation and Formal Languages , 1997 .

[10] Jon Barwise,et al. Turing's World 3.0 for the Macintosh: An Introduction to Computability Theory/Book and Disk (Csli Lecture Notes) , 1993 .