Non-Deterministic Finite Automata Simulation
-
Updated
Jul 30, 2022 - C++
Non-Deterministic Finite Automata Simulation
Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.
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.
Automata Simulator: DFA & NFA
feasible policy generator for nondeterministic system with LTL constraints
Foundations of Computer Science course at the University of Massachusetts Lowell.
An implementation of a DFA & NFA
This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
Builds and parses regular expressions using non-deterministic finite automata (3rd year Graph Theory assignment)
formal_language_theory_midterm_project_spring_1402
A repo containing some projects regarding Finite Languages and Automata
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
A turing machine for both deterministic and nondeterministic way
A simple interpreted language for building Turing machines and other automata
Formal Languages and Automata Course (2020-2021)
Deterministic and nondeterministic finite automata and regular expressions in Go.
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."