An interpreter of a compact language for working with Deterministic Finite Automata.

Deterministic Finite Automata: This program analyzes a string of 0's and 1's, manually or automatically, and tells you if the string have the same number of 0's than 1's. Also. It works with an automata

A python program that helps convert NFAs to DFAs. (Uses networkx)

Created a Deterministic Finite Automata to serve as a Gumball Machine

Simulate games involving a system of multiple state machines interacting with each other

Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)

Analizador léxico de automatas finitos y gramaticas regulares. Proyecto basado en Consola Python.

This repository contains all the exercises done in the Theory of Computation course, addressing topics such as deterministic and nondeterministic finite automata, as well as grammar generation, along with an implementation of the Turing machine.

Projet CY-Tech

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

Classes to simulate various automatas in Formal Language Theory

A simple example of Deterministic Finite Automata (DFA) in Python.

Simulate a string if it is valid in the deterministic finite automaton (DFA)

Program that reads a description of a Deterministic Finite Automaton (DFA) and then classifies input strings as accepted or rejected by the DFA

Exercício Programa que faz a emulação de um Autômato Finito Não Determinístico (AFN) para a matéria de Introdução à Teoria da Computação 💻

This repo consists of the python implementation of deterministic finite automaton by utilizing object oriented programming.

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.

🔮 Playing around with deterministic & non deterministic finite state automatas

DFA Optimization Challenge as presented by Computerphile