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