NFA / DFA based Regex Engine in TS.
-
Updated
Jan 10, 2024 - JavaScript
NFA / DFA based Regex Engine in TS.
Simulator of Deterministic Finite Automata
Simulate and compare finite state machines
DFA Appointment Availability Checker
NFA to DFA Convertor written with JS
This is a tester that will allow you to put in a transition table for a DFA with up to 26 states and unlimited transitions.
Experiment to test multiple words into nondeterministic finite automatas.
Deterministic Finite Automaton Designer
Find place names using Deterministic Finite Automaton (DFA)
NFA to DFA built with AngularJS
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
draw NFA , convert to DFA , minimize DFA , export all graphs
a compiler that converts regular expressions to images of DFA
A regex-to-DFA construction visualizer.
converting NFA to DFA with graphical interface
University project automata theory languages and computation
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."