A Python package for automata theory.
-
Updated
Jan 17, 2024 - Python
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 repo containing some projects regarding Finite Languages and Automata
A turing machine for both deterministic and nondeterministic way
A simple 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)
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.
Formal Languages and Automata Course (2020-2021)
Projet CY-Tech
Non-Deterministic Finite Automata Simulation
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.
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."