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.
-
Updated
Dec 31, 2017 - C++
#
nfa2dfa
Here are 3 public repositories matching this topic...
A C++ Automata simulator that models and visualizes automata using JSON inputs and generates .dot files for visualization. Built for the "Languages & Automata" 1st bachelor course at the University of Antwerp.
-
Updated
Sep 15, 2024 - C++
A cpp program to simulate a DFA or an NFA and convert the NFA to a corresponding DFA
-
Updated
Dec 11, 2018 - C++
Improve this page
Add a description, image, and links to the nfa2dfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the nfa2dfa topic, visit your repo's landing page and select "manage topics."