Non-Deterministic Finite Automata Simulation
-
Updated
Jul 30, 2022 - C++
Non-Deterministic Finite Automata Simulation
A repo containing some projects regarding Finite Languages and Automata
Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.
Automata Simulator: DFA & NFA
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
Design a NFA to accept words composed by the letters in "HIDALGO", in any order, with a maximum of: two A's, one D, and one L. It can have any number of H's, I's, G's and, O's.
A turing machine for both deterministic and nondeterministic way
Fundamental computing machines implemented in Clojure.
feasible policy generator for nondeterministic system with LTL constraints
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
A simple free-form interpreted language for building Turing machines and other automata
Foundations of Computer Science course at the University of Massachusetts Lowell.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Uma ferramenta para criar e validar Expressões Regulares
An implementation of a DFA & NFA
Formal Languages and Automata Course (2020-2021)
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."