NFA to DFA Converter

🚀 Try the Live Demo Here!

A visual tool for converting Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA). This tool provides an interactive graphical interface to visualize state transitions and understand the subset construction algorithm step-by-step.

This implementation was done by Rishi Yadav.

🏆 Achievements

🥇 1st Prize Winner!
Check out my LinkedIn post about winning first prize for this project: View Post on LinkedIn

Features

• Interactive Graphs: Visualizes the NFA and DFA graphs using d3.js and dagre-d3.
• Step-by-Step Conversion: Displays the subset construction conversion steps clearly.
• State Transition Tables: Generates transition tables for both NFA and DFA.
• Custom NFA Input: Easily define custom states, alphabets, and transitions.

How to Use

1. Open index.html in your web browser.
2. Enter your NFA configuration in the input text area. The format should be:
   • Line 1: Comma-separated list of all states (e.g., A,B,C)
   • Line 2: Start state (e.g., A)
   • Line 3: Comma-separated list of final states (e.g., C)
   • Subsequent Lines: Transitions in the format FROM,SYMBOL,TO (e.g., A,0,A, A,1,B)
3. Click Generate NFA to draw the NFA graph and table.
4. Click Convert to DFA to run the subset construction algorithm and display the DFA graph, table, and conversion steps.

Project Structure

• index.html: The main markup structure.
• style.css: All styles, layouts, and animations.
• script.js: Core logic for parsing NFA, drawing graphs, and computing the DFA conversion.
• README.md: Project documentation.

Technologies Used

• HTML5 & CSS3
• Vanilla JavaScript
• D3.js (v7) for rendering SVGs.
• Dagre-D3 for directed graph layout.

License

This project is licensed under the MIT License.