A Web Application to convert NFA to DFA.
-
Updated
Oct 7, 2020 - JavaScript
A Web Application to convert NFA to DFA.
Graphical interface for designing finite automata
This is the repository for DSAAT CP
Regular expression to DFA, with DOT format output for visualization
A regex-to-DFA construction visualizer.
Convert NFA to DFA (json output) from (json input, .nfa file)
draw NFA , convert to DFA , minimize DFA , export all graphs
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
Aplikas Finite Automata Text Search menggunakan mesin nondeterministik finite automata (NFA) dengan menerapkan extended transition function (delta topi). Dalam text search, penerapan konsep NFA (Non-deterministic Finite Automata) dapat digambarkan saat kita diberi satu set string yang akan disebut dengan kata kunci (keyword), kemudian NFA akan m…
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
Chrome Extensie om het design van de DLO aan te passen. Nog in Beta
NFA / DFA based Regex Engine in TS.
This is a JavaScript program, which converts a given regular expression to NFA.
University project automata theory languages and computation
NFA to DFA Convertor written with JS
Visualization of NFAs built by Thompson's algorithm
Experiment to test multiple words into nondeterministic finite automatas.
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."