在线可视化地设计、运行自动机，支持DFA和TM Feel free to create & run your DFA and TM🍩Based on React+Next.js+Mobx+Vis Network
Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
Computation Theory Simulator is an interactive, canvas-first web application for building, editing, converting, and simulating multiple automata models used in formal languages and automata theory courses.
Context free grammar to pushdown automaton convertor, along with string parser - Theory of Languages and Machines project, spring 2020
Implementation of a pushdown automaton (PDA) in Java for learning purposes
Implementation of the famous "Game of Life" algorithm (cellular automata discovered by John Horton Conway) as WinForms-app in C#
Implementation of PushDown Automata to track acceptance or rejection of a string.
A C++ library for simulating automata and Turing machines
Web Application to play with finite state machines and run algorithms on top of the finite state machines
Simulador de Autômatos Celulares
A PyTorch library for simulating Turing machines with neural networks. Includes constructions from Siegelmann & Sontag (1995) and Wei, Chen & Ma (2021).
🔄 Deterministic Finite Automata simulator 🔄
Simple Timed I/O Automata Simulator for Distributed Algorithms
An automata simulator, converts a regular expression to a Finite Deterministic Automata.
ALE - Automata & Logic Engineering
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
Learning how to simulate a grammer in a Non Deterministic Finite Automata
Uma maquina de Turing feita pela disciplina Linguagens Formais e Automatos na realização do Bacharelado de Ciencia da Computação
Simulate a string if it is valid in the deterministic finite automaton (DFA)
Add a description, image, and links to the automata-simulator topic page so that developers can more easily learn about it.
To associate your repository with the automata-simulator topic, visit your repo's landing page and select "manage topics."