A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Using JFLAP to interact with theorems in automata theory
1999
The proceedings of the thirtieth SIGCSE technical symposium on Computer science education - SIGCSE '99
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,
doi:10.1145/299649.299800
dblp:conf/sigcse/GramondR99
fatcat:mu24d42pijcgles7x7xihuxa34