🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
-
Updated
Mar 27, 2020 - C++
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
A repo containing some projects regarding Finite Languages and Automata
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Non-Deterministic Finite Automata Simulation
Foundations of Computer Science course at the University of Massachusetts Lowell.
Add a description, image, and links to the nondeterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the nondeterministic-finite-automata topic, visit your repo's landing page and select "manage topics."