A Python package for automata theory.
-
Updated
Jan 17, 2024 - Python
A Python package for automata theory.
A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method
A document sharing server-client architecture similar to Google Document
Implementation of a class for creating deterministic finite state machines, two examples are presented. The first practice on the subject "Theory and development of programming languages"
A Qt 5 Python GUI application for converting regular expressions to a finite automaton
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
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.
A python program that helps convert NFAs to DFAs. (Uses networkx)
Created a Deterministic Finite Automata to serve as a Gumball Machine
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
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 simple example of Deterministic Finite Automata (DFA) in Python.
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.
🔮 Playing around with deterministic & non deterministic finite state automatas
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."