FSM Generator is a simple web application that allows you to generate finite state machines (FSM) / Deterministic Finite Automata (DFA) from regular expressions.
-
Updated
Mar 17, 2023 - JavaScript
FSM Generator is a simple web application that allows you to generate finite state machines (FSM) / Deterministic Finite Automata (DFA) from regular expressions.
Diploma Thesis - CEID University of Patras. Application name: N2D: NFA to DFA Converter
prosty projekt webowy generujący graf abstrakcyjnych maszyn
Uma ferramenta para criar e validar Expressões Regulares
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
Simulates path of a given DFA using a state diagram
The "Automata Learning Lab da Universidade Aberta (UAbALL)" strives to be an integrated laboratory for simulation of Automata. A first phase focused on building the base and introducing the Simulation of Deterministic Finite Automata (DFA). This Laboratory intends to enjoy the capacity of extensibility and adaptability, being this document a tec…
Graphical interface for designing finite automata
🧫 A complex cellular automaton which simulates an entire ecosystem : universe, flora and fauna.
A tool for testing and simulating Deterministic Finite Machines with string inputs
Converts a given epsilon-NFA to NFA to DFA
Deterministic Finite Automaton Designer
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."