Builds and parses regular expressions using non-deterministic finite automata (3rd year Graph Theory assignment)
-
Updated
Mar 31, 2019 - Python
Builds and parses regular expressions using non-deterministic finite automata (3rd year Graph Theory assignment)
A parser for regex expressions, converting them to equivalent ER (regular expressions), then to corresponding Nondeterministic & Deterministic Finite-State Machine (NFA & DFA) built for checking validity of given strings.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
An implementation of a DFA & NFA
A Python package for automata theory.
Projet CY-Tech
Formal Languages and Automata Course (2020-2021)
NFA framework for INSA-CVL 4A class on Verification / Model-Checking
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."