Deterministic and nondeterministic finite automata and regular expressions in Go.

feasible policy generator for nondeterministic system with LTL constraints

A turing machine for both deterministic and nondeterministic way

Builds and parses regular expressions using non-deterministic finite automata (3rd year Graph Theory assignment)

A repo containing some projects regarding Finite Languages and Automata

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.

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.

🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.

Fundamental computing machines implemented in Clojure.

Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)

🤖 Implementação de um Autômato Finito Não-Determinístico para a disciplina de Introdução a Teoria da Computação

Foundations of Computer Science course at the University of Massachusetts Lowell.

Non-Deterministic Finite Automata Simulation

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.

Uma ferramenta para criar e validar Expressões Regulares

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