A proof of concept C++ application for learning regular languages
-
Updated
Dec 27, 2022 - C++
A proof of concept C++ application for learning regular languages
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
A finite state machine for a T-section traffic light controller
a verbose regular expression engine for learning purposes
In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.
NFA / DFA based Regex Engine in TS.
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.
DFA Minimization
RegEx Wizard v5.0
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.
Dart Deterministic Finite Automata implementation.
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."