Visualizing Why Nondeterministic Finite-State Automa Reject
summary
A visualization tool builds computation graphs from FSM ndfa definitions using a breadth‑first traversal (make_ndfa_CG_edges) to collect edges, remove duplicates, and trim unused edges for accepted inputs. Rejection is explained by adding a fresh dead state when no consuming transition exists and by highlighting any end‑of‑computation nodes as Crimson states, so the graph is a subgraph of the transition diagram. Implementation in Racket works interactively; classroom user studies are planned.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 0:46What are nondeterministic finite-state automata
- 3:17Related work
- 7:10FSM programming
- 11:28Computation graphs importance
- 15:19Accepted words demo
- 16:25Rejected words explained
- 19:14Graph generation
- 21:44Conclusion
- 22:48Q&A
related talks
28mVisualizing Abstract Abstract Machines
18mGraphScape: A Model for Automated Reasoning about Visualization Similarity and Sequencing
21mLinked Visualisations via Galois Dependencies
37mVisualizing Persistent Data Structures
19mmayAI? Exploring Graphical Tools for Model Visualization & Enh.
21mPractical compositional diagramming
20mAttack of the Graph: Visual Tools for Cyber Analysis
28mGraphs and Vogue Dance: using data structures to create choreographies