states is a utility for working with NFA, DFA and regular expressions
-
Updated
Sep 16, 2014 - C++
states is a utility for working with NFA, DFA and regular expressions
Detect useless transitions in Pushdown Automata
Programs
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Implementation of a Non-deterministic Finite Automaton in C++. The program can show the dead states, check if the NFA is a DFA and analyze a string to see if it belongs to the NFA.
Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL
A program to convert the given regular expression to Non Definite Automata (NFA)
Built a compiler generator tool which can be supplied with lexical and grammar rules of any programming language and used to generate the lexical and syntax analyzer needed to generate intermediate code.
A simple regular expression engine implemented in C++.
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
REGEX-NFA converter and NFA simulator
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."