🚀 automaton AKA Proyecto 1

You can effortlessly generate graphs from regular expressions, including Abstract Syntax Tree, Non-deterministic Finite Automaton, Deterministic Finite Automaton, and Minimized Finite Automaton. Additionally, iAutomaton enables you to simulate these automata with various input strings.

This interface works directly with automaton-server (repository).

📑 Index

• 🌐 How to use it?
• 🤔 Why I code this?
• 🧐 Who I am?

How to use it?

This project uses react, typescript and vite. To run it simply use:

npm install

npm run dev

⚠️ Don't forget to configure the .env file with the server URL.

Why I code this?

Es un agregado al Proyecto No. 1 de Teoría de la Computación Sección 20 del Segundo ciclo 2023. Valía puntos, fuí coaccionado 😭.

Who I am?

Samuel A. Chamalé - Human

Guatemala, 2023