Repository files navigation

An interactive web-based tool for visualizing step-by-step conversions between different types of automata and formal language representations. This educational tool helps students and researchers understand the relationships between NFAs, DFAs, Regular Expressions, and Context-Free Grammars.

• NFA to DFA - Subset Construction Algorithm
• DFA to NFA - Direct Conversion
• Regular Expression to NFA - Thompson's Construction
• Regular Expression to DFA - Via NFA intermediate step
• NFA to Regular Expression - State Elimination Method
• DFA to Regular Expression - State Elimination Method
• CFG to PDA - Context-Free Grammar to Pushdown Automaton

• Step-by-step conversion process with detailed explanations
• Interactive graph visualization using vis.js network library
• 35+ pre-built examples covering various automata patterns
• Forward/backward navigation through conversion steps
• Complete conversion overview option

• Detailed step explanations for each conversion algorithm
• Visual state diagrams with clear transitions
• Academic-focused interface designed for learning
• Multiple example categories for comprehensive understanding

• Computer Science Education - Teaching automata theory concepts
• Algorithm Visualization - Understanding conversion algorithms
• Research Tool - Quick automata conversions and visualizations
• Self-Study - Interactive learning of formal language theory

• HTML5 - Structure and semantic markup
• CSS3 - Styling with modern features and responsive design
• Vanilla JavaScript - Core functionality and interactivity
• vis.js - Network graph visualization library
• Tailwind CSS - Utility-first CSS framework via CDN
• Google Fonts - Roboto Mono for consistent typography

1. Clone the repository:

   git clone https://github.com/dev-4hmad/automata-conversion-visualizer.gitcd automata-conversion-visualizer