Visualizing a Nondeterministic to Deterministic Finite-State Machine Transform...
summary
A visualization tool implements NDFA→DFA by computing empties, traversing reachable superstates instead of the full power set, and encoding a dead state; the DFA is built as step-by-step DFA edges built while the NDFA stays fully shown with color-coded ndfa edges (hedges, fedges, bges) and full forward/backward stepping. Compared to JFLAP the resulting DFA layout stays consistent across ten runs thanks to Graphviz; the prototype is implemented and behaves predictably for students.
AI-written summary · about
chapters (13)
- 0:00NFA to DFA visualization intro
- 1:49How the tool works
- 3:15FSM programming demo
- 5:28Step-by-step NFA to DFA
- 7:59JFLAP comparison
- 9:03Optimized algorithm
- 11:10Tool interface & features
- 13:17Live tool demo
- 16:10Implementation details
- 18:38Student learning benefits
- 19:41JFLAP multi-run comparison
- 20:43Future work & features
- 21:24Q&A
related talks
28mVisualizing Abstract Abstract Machines
21mLinked Visualisations via Galois Dependencies
28mGraphs and Vogue Dance: using data structures to create choreographies
37mVisualizing Persistent Data Structures
18mGraphScape: A Model for Automated Reasoning about Visualization Similarity and Sequencing
19mmayAI? Exploring Graphical Tools for Model Visualization & Enh.
16mType-Directed Synthesis of Visualizations from Natural Language Queries
16mUsing visualisations for addressing fleet management problems