A Python package for automata theory.

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

Uma ferramenta para criar e validar Expressões Regulares

NFA framework for INSA-CVL 4A class on Verification / Model-Checking

Fundamental computing machines implemented in Clojure.

Pure-Python library for building and working with nondeterministic finite automata (NFAs).

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.

🖧 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

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 turing machine for both deterministic and nondeterministic way

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

Projet CY-Tech

Formal Languages and Automata Course (2020-2021)

Deterministic and nondeterministic finite automata and regular expressions in Go.

Non-Deterministic Finite Automata Simulation