Context free grammar to pushdown automaton convertor, along with string parser - Theory of Languages and Machines project, spring 2020

Implementation of PushDown Automata to track acceptance or rejection of a string.

Simple Timed I/O Automata Simulator for Distributed Algorithms

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

Mathematical simulation of Terraria's dynamic world generation with cellular automata.

Automata-Toolbox implements various types of automata, including DFA, NFA, CFG and PDA.

NFA to DFA conversor.

Tugas Besar Mata Kuliah Teori Bahasa dan Automata

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

Cellular-Automata-Visualizer is a collection of four interactive cellular automaton simulations with real-time, color-coded grid visualizations, implemented in Python mode using Processing.

Visualizations of cellular automata

Simple LRI machine implementation

A library for simple automata simulation written in Python 3

Cellular automaton; It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves

Introduction to Theoretical Computer Science laboratory exercises - Python solutions.

A Python GUI app to design, visualize, and simulate finite automata (DFA/NFA) with interactive analysis and word processing.

Another implementation of Finite State Machine and extensions for Django context.

Simple python 3 implementation for finite automatons and regular expressions

Contrução de um simulador de Autômato Finito Deterministico em Python feito com o objetivo de concluir uma atividade extra da disciplina LFA(Linguagens Formais e Autômatos)