Models of computation and formal languages
Models of computation and formal languages
A preliminary empirical evaluation of the effectiveness of a finite state automaton animator
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
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
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
Learning automata and formal languages interactively with JFLAP
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Journal of Computing Sciences in Colleges
RegeXeX: an interactive system providing regular expression exercises
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Interactive symbolic software for teaching formal languages, automata and beyond
Journal of Computing Sciences in Colleges
ProofChecker: an accessible environment for automata theory correctness proofs
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
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
Web-based learning tools: storing usage data makes a difference
WBED'07 Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2
Formal languages through web forms and regular expressions
ACM SIGCSE Bulletin
Incorporating transformations into jflap for enhanced understanding of automata
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Understanding the Universal Turing Machine: an implementation in JFLAP
Journal of Computing Sciences in Colleges
Two mathematical gestalts for computer theory
Proceedings of the 40th ACM technical symposium on Computer science education
Fifty years of automata simulation: a review
ACM Inroads
Relating automata to other fields
Journal of Computing Sciences in Colleges
Teaching theoretical computer science using a cognitive apprenticeship approach
Proceedings of the 45th ACM technical symposium on Computer science education
| Hi-index | 0.00 |
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are tedious to solve using pencil and paper. In combination with the more traditional theory problems, students study a wider-range of problems on a topic. Thus, students explore the formal languages and automata concepts computationally and visually with JFLAP, and theoretically without JFLAP. In addition, we present a new feature in JFLAP, Turing machine building blocks. One can now build complex Turing machines by using other Turing machines as components or building blocks.