A Python package for automata theory.

A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method

A python CLI tool for creating diagrams of finite state machines.

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

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

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.

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 set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)

Web application that utilizes Deterministic Finite Automata as a conjunction finder and find patterns

A Qt 5 Python GUI application for converting regular expressions to a finite automaton

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

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

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)

A document sharing server-client architecture similar to Google Document

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

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

🔮 Playing around with deterministic & non deterministic finite state automatas

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 💻