A Python library for simulating finite automata, pushdown automata, and Turing machines
-
Updated
Mar 19, 2026 - Python
An automaton is a relatively self-operating machine designed to automatically follow a sequence of operations.
The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
A Python library for simulating finite automata, pushdown automata, and Turing machines
A Python package for automata theory.
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
An implementation of the LSTAR Grammatical Inference Algorithm
Goal-Oriented Action Planning implementation in Python
DeepSynth: Automata Synthesis for Automatic Task Segmentation in Deep Reinforcement Learning
A minimal Python finite-state machine.
Implementation of PDFAs and PDFA learning algorithm.
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
This compiler was developed as a project of the Formal Languages and Compilers class at State University of Feira de Santana.
Produce DTrace monitoring scripts from graphviz-encoded automata
Quantum Finite Automata simulators implementations in Python.
Deterministic finite automaton built in python
Pushdown automaton made with Python
TransPYler is a Python-based transpiler powered by PLY. It parses Python code and translates it into C plus plus code, preserving logic and structure.
Trabalho final da cadeira Linguagens Formais e Autômatos 2019/01
Console program reads an automaton's transition table and generates the corresponding Deterministic Finite Automaton. It can also indicate whether a given string is accepted or not by the DFA language.