Increasing visualization and interaction in the automata theory course
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Elements of the Theory of Computation
Elements of the Theory of Computation
A visual and interactive automata theory course with JFLAP 4.0
Proceedings of the 35th SIGCSE technical symposium on Computer science education
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
Turning automata theory into a hands-on course
Proceedings of the 37th SIGCSE technical symposium on Computer science education
jFAST: a java finite automata simulator
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Editorial for the special issue on software support for teaching discrete mathematics
Journal on Educational Resources in Computing (JERIC)
Realizing the promise of visualization in the theory of computing
Journal on Educational Resources in Computing (JERIC)
JFLAP: An Interactive Formal Languages and Automata Package
JFLAP: An Interactive Formal Languages and Automata Package
An Introduction to Formal Language and Automata
An Introduction to Formal Language and Automata
Increasing interaction and support in the formal languages and automata theory course
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Understanding the Universal Turing Machine: an implementation in JFLAP
Journal of Computing Sciences in Colleges
Increasing engagement in automata theory with JFLAP
Proceedings of the 40th ACM technical symposium on Computer science education
| Hi-index | 0.00 |
This paper describes our experience extending the educational software program JFLAP. JFLAP enables students to design and simulate automata such as Finite State Machines, push-down automata, and Turing Machines. It is a valuable aid in any Automata Theory course. We modified JFLAP so that students could write Java programs that alter the actual automaton itself. This utility greatly increases the students' ability to grasp such fundamental topics as the Church-Turing thesis and the theory of undecidability.