Graphical interface for designing finite automata
-
Updated
Oct 11, 2020 - JavaScript
Graphical interface for designing finite automata
This is a simple single page web-application calculator to demonstrate Search the word in the given text document by the use of NFA and conversion from Regular Expression to Non-deterministic automata (NFA) using source libraries such as React.JS, Node.JS and Express.JS etc..
Converts a given epsilon-NFA to NFA to DFA
Experiment to test multiple words into nondeterministic finite automatas.
Diploma Thesis - CEID University of Patras. Application name: N2D: NFA to DFA Converter
NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
Add a description, image, and links to the non-deterministic-finite-automaton topic page so that developers can more easily learn about it.
To associate your repository with the non-deterministic-finite-automaton topic, visit your repo's landing page and select "manage topics."