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.
A model verifier for finite automata written in C++
Non-deterministic Finite Automata to Deterministic Finite Automata converter
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
A utility tool used for validating regular expressions corresponding to a provided word
Naive Algorithm, Rabin-Karp Algorithm, Finite Automata Algorithm, KMP Algorithm.
Deterministic finite automaton
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
A simple C++ library to simulate Finite Automata.
Project for the university course Formal Languages and Automata Theory. The code implements a Mealy Machine using C++.
Add a description, image, and links to the finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the finite-automata topic, visit your repo's landing page and select "manage topics."