This project focuses on converting a regular expression into a non-deterministic finite automaton (NFA) using the δ-NFA technique. The implementation is done in C++, but it requires further ...
A Python-based tool to parse regular grammars, convert them into Non-deterministic Finite Automata (NFA), validate strings against the NFA, and visualize the NFA as a graph.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback