Using JFLAP to interact with theorems in automata theory

Conference Paper

An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. Recently, we have enhanced JFLAP to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA. In addition, our enhancementsc ombined with other tools allow one to interactively study LL and LR parsing methods.

Duke Authors

Cited Authors

  • Gramond, E; Rodger, SH

Published Date

  • March 24, 1999

Published In

  • Sigcse 1999 Proceedings of the 13th Sigcse Technical Symposium on Computer Science Education

Start / End Page

  • 336 - 340

International Standard Book Number 13 (ISBN-13)

  • 9781581130850

Citation Source

  • Scopus