Increasing the experimentation of theoretical computer science with new features in JFLAP

Published

Journal Article

JFLAP is an educational software tool for experimenting with several types of automata, grammars and proofs related to the area of theoretical computer science. For example, one can create an NFA, convert it to a DFA, minimize the number of states in the DFA, convert it to a regular expression or convert it to a regular grammar. Once created, one can simulate test strings. JFLAP includes a large number of topics and proofs to experiment with from the regular languages, context-free languages, recursively enumerable languages and l-systems. This poster describes several new features in a redesign of JFLAP that includes a more flexible grammar representation, explicit formal definitions, basic set theory tools, and new algorithms.

Full Text

Duke Authors

Cited Authors

  • Rodger, SH; Genkins, J; McMahon, I; Li, P

Published Date

  • August 12, 2013

Published In

Start / End Page

  • 351 -

International Standard Serial Number (ISSN)

  • 1942-647X

Digital Object Identifier (DOI)

  • 10.1145/2462476.2466521

Citation Source

  • Scopus