University project automata theory languages and computation
-
Updated
Jan 11, 2024 - JavaScript
University project automata theory languages and computation
NFA to DFA Convertor written with JS
NFA / DFA based Regex Engine in TS.
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
This is the repository for DSAAT CP
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (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…
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
A regex-to-DFA construction visualizer.
Chrome Extensie om het design van de DLO aan te passen. Nog in Beta
Graphical interface for designing finite automata
A Web Application to convert NFA to DFA.
converting NFA to DFA with graphical interface
regular expression parser engine
draw NFA , convert to DFA , minimize DFA , export all graphs
This is a JavaScript program, which converts a given regular expression to NFA.
Visualization of NFAs built by Thompson's algorithm
Regular expression to DFA, with DOT format output for visualization
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."