Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
-
Updated
Dec 30, 2017 - C++
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Implementation of a DFA in C++. The program can read, show, minimize and export a DFA. Besides, it can show the dead states and analyze a string to see if it belongs to the DFA.
Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
I have tried to make a DFA-Maker. You enter a regular expression or regex containing concatenation, or and grouping operations and as an output, you will get a PNG file containing the DFA for that accepts that regular expression.
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
A simple program to create DFAs and test them
Deterministic finite automaton
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Foundations of Computer Science course at the University of Massachusetts Lowell.
A proof of concept C++ application for learning regular languages
Programs in the domain of Compiler Construction and Automata Formal Language. Some of the problems included are
A C++ library to create, load, and analyze Deterministic Finite Automata (DFA) with up to 10 states and lowercase letter alphabets. Offers file loading, state modification, and string acceptance checks.
Deterministic Finite Automata
This is the "one": Linuxy infrastructureish mostly C++ code.
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."