SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
A paradigm shift! The Internet, the Web, browsers, Java and the future of computer science education
SIGCSE '98 Proceedings of the twenty-ninth 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
Engaging students with active learning resources: hypertextbooks for the web
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
The Mythical Man-Month: Essays on Softw
The Mythical Man-Month: Essays on Softw
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
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
Using theoretical computer simulators for formal languages and automata theory
ACM SIGCSE Bulletin
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
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
VLex: visualizing a lexical analyzer generator -- tool demonstration
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Fifty years of automata simulation: a review
ACM Inroads
Proceedings of the 18th ACM conference on Innovation and technology in computer science education
| Hi-index | 0.00 |
The FSA Simulator is a Java program created to allow computer science students to experiment with finite state automata. The program is able to simulate both deterministic and nondeterministic automata. Pre-defined automata can be loaded from files or students can create their own. Although this project is similar to others, it has its own unique features. The development history, features, and future plans for this program are discussed.