-
Updated
Jul 8, 2021 - C++
nondeterministic-finite-automata
Here are 30 public repositories matching this topic...
Automata Simulator: DFA & NFA
-
Updated
Jun 11, 2024 - Java
Non-Deterministic Finite Automata Simulation
-
Updated
Jul 30, 2022 - C++
A turing machine for both deterministic and nondeterministic way
-
Updated
Mar 20, 2019 - C
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
-
Updated
Feb 13, 2023 - Python
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.
-
Updated
Mar 26, 2020 - Jupyter Notebook
-
Updated
Jul 15, 2023 - Java
A repo containing some projects regarding Finite Languages and Automata
-
Updated
May 10, 2019 - C++
Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.
-
Updated
Sep 17, 2022 - Python
A simple interpreted language for building Turing machines and other automata
-
Updated
May 19, 2024 - C
-
Updated
May 9, 2019 - C++
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
-
Updated
Mar 27, 2020 - C++
Fundamental computing machines implemented in Clojure.
-
Updated
Feb 27, 2021 - Clojure
feasible policy generator for nondeterministic system with LTL constraints
-
Updated
Feb 16, 2019 - Rust
Foundations of Computer Science course at the University of Massachusetts Lowell.
-
Updated
Nov 19, 2021 - C++
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
-
Updated
Aug 4, 2022 - Python
Builds and parses regular expressions using non-deterministic finite automata (3rd year Graph Theory assignment)
-
Updated
Mar 31, 2019 - Python
Deterministic and nondeterministic finite automata and regular expressions in Go.
-
Updated
Sep 26, 2018 - Go
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.
-
Updated
Mar 1, 2020 - Python
🤖 Implementação de um Autômato Finito Não-Determinístico para a disciplina de Introdução a Teoria da Computação
-
Updated
Aug 10, 2021 - Java
Improve this page
Add a description, image, and links to the nondeterministic-finite-automata topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the nondeterministic-finite-automata topic, visit your repo's landing page and select "manage topics."