Create a deterministic finite automata (DFA) and use it to parse binary strings. Features:
- Add states
- Add transitions between states
- Allow 1 transition for each letter from each state
- Add accepting states
- Make start state accepting
- Parse binary strings
- Reset graph
Install dependencies:
npm install
# or
yarn install
Run the development server:
npm run dev
# or
yarn dev
Open http://localhost:3000 with your browser to see the result.