Simulation of Turing machines by a regular rewrite rule
Theoretical Computer Science
A collection of tools for making automata theory and formal languages come alive
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Using JFLAP to interact with theorems in automata theory
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
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
Reducing abstraction level when learning computability theory concepts
Proceedings of the 7th annual conference on Innovation and technology in computer science education
Compiler Design
Elements of the Theory of Computation
Elements of the Theory of Computation
Animating automata: a cross-platform program for teaching finite automata
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Loving to learn theory: active learning modules for the theory of computing
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
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
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Using theoretical computer simulators for formal languages and automata theory
ACM SIGCSE Bulletin
Exploring the role of visualization and engagement in computer science education
Working group reports from ITiCSE on Innovation and technology in 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
Didactic strategies for promoting significant learning in formal languages and automata theory
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
A classroom experiment for teaching automata
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Engaging students in formal language theory and theory of computation
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Incorporating transformations into jflap for enhanced understanding of automata
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Visualization of rule-based programming
Proceedings of the 2008 ACM symposium on Applied computing
A practical state machine project
Proceedings of the 47th Annual Southeast Regional Conference
| Hi-index | 0.00 |
Teaching Theory of Computation and learning it are both challenging tasks. Moreover, students are not sufficiently interested/motivated to learn this material since: (i) they believe that the material is dated and of little use and (ii) it is too abstract and difficult. To counter the first perception, we have developed materials to illustrate the breadth of finite automata concepts. To overcome the second problem we have: enhanced and integrated visualization software and historical background into newly-devloped materials including homeworks and slides for lectures. Most of the materials are available at a web site for the course that we developed. Our preliminary experience is positive overall, but there are some remaining concerns.