Non-Deterministic Finite Automata Simulation

Automata Simulator: DFA & NFA

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.

Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.

feasible policy generator for nondeterministic system with LTL constraints

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

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

formal_language_theory_midterm_project_spring_1402

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).

A turing machine for both deterministic and nondeterministic way

This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)

A repo containing some projects regarding Finite Languages and Automata

A simple free-form interpreted language for building Turing machines and other automata

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

Deterministic and nondeterministic finite automata and regular expressions in Go.