This project is a finite automaton editor. You can draw the automaton, make it deterministic (i.e. transform it from an NFA to a DFA), reduce the number of states, etc.
This project is based on the Konva rendering library (with Typescript). A PEG.JS parser is used to parse regular expressions.
Detailed documentation is available (in French) on the website.
Run the following commands to compile the project.
npm install
npm run build
# or
yarn
yarn build
After the dependencies were installed, run the following command to recompile the parser.
npm run compile-parser
# or
yarn compile-parser
This project was part of the tutoring work I do at Clemenceau High School (Nantes, France). It was made as a tool for students to learn about automatons and the operations that can be applied to them.