A collection of tools for making automata theory and formal languages come alive

Authors:
Susan H. Rodger;Anna O. Bilska;Kenneth H. Leider;Magdalena Procopiuc;Octavian Procopiuc;Jason R. Salemme;Edwin Tsang
Affiliations:
Duke University, Durham, NC;Duke University, Durham, NC;Duke University, Durham, NC;Duke University, Durham, NC;-;Duke University, Durham, NC;Duke University, Durham, NC
Venue:
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Year:
1997

Citing 6
Cited 19

Tango: A Framework and System for Algorithm Animation

Computer
Hypercard automata simulation: finite-state, pushdown and Turing machines

ACM SIGCSE Bulletin
LLparse and LRparse: visual and interactive tools for parsing

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
An interactive lecture approach to teaching computer science

SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Integrating Hands-on Work into the Formal Languages Course via Tools and Programming

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Visualization and interaction in the computer science formal languages course with JFLAP

FIE '96 Proceedings of the 26th Annual Frontiers in Education - Volume 01

A paradigm shift! The Internet, the Web, browsers, Java and the future of computer science education

SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Animating parsing algorithms

SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
A Java-based tool for reasoning about models of computation through simulating finite automata and Turing machines

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Using JFLAP to interact with theorems in automata theory

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Increasing visualization and interaction in the automata theory course

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Recursion in gradual steps (is recursion really that difficult?)

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Computer laboratories for the theory of computing course

CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
A framework to visualize equivalences between computational models of regular languages

Information Processing Letters
The use of web-based visualization techniques and its effect on student comprehension

Journal of Computing Sciences in Colleges
Using theoretical computer simulators for formal languages and automata theory

ACM SIGCSE Bulletin
Language emulator, a helpful toolkit in the learning process of computer theory

Proceedings of the 35th SIGCSE technical symposium on Computer science education
A visual and interactive automata theory course with JFLAP 4.0

Proceedings of the 35th SIGCSE technical symposium on Computer science education
Implementing NFAS in a spreadsheet

Journal of Computing Sciences in Colleges
A visual and interactive automata theory course emphasizing breadth of automata

ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Visualization in education of theoretical computer science

CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Experimenting with formal languages using forlan

Proceedings of the 2008 international workshop on Functional and declarative programming in education
On using of random access machine simulators in teaching of theoretical computer science

CompSysTech '09 Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Fifty years of automata simulation: a review

ACM Inroads
A Two-Perspective Visualization Approach for Utilizing Visualization Power in Computer Science Education

Proceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; Pâté for parsing restricted and unrestricted grammars and transforming context-free grammars to Chomsky Normal Form; and PumpLemma for proving specific languages are not regular. Enhancements to previous tools LLparse and LRparse, instructional tools for parsing LL(1) and LR(1) grammars, include parsing LL(2) grammars, displaying parse trees, and parsing any context-free grammar with conflict resolution.