There are 2 repositories under automata-simulator topic.
在线可视化地设计、运行自动机,支持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)
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.
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#
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
🔄 Deterministic Finite Automata simulator 🔄
Simulador de Autômatos Celulares
An automata simulator, converts a regular expression to a Finite Deterministic Automata.
Learning how to simulate a grammer in a Non Deterministic Finite Automata
Simulate a string if it is valid in the deterministic finite automaton (DFA)
🤖 Abacus Machine and Random Access Machine simulators built in Elm as part of bachelor's thesis project.
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
:memo: Uma maquina de Turing feita pela disciplina Linguagens Formais e Automatos na realização do Bacharelado de Ciencia da Computação
un TP pour la simulation des automates à états finis déterministes
A senior honors thesis developing a Java graphical application for computational automata.
Web application for building and testing Automata.
An online cellular automata playground with a variety of automata and customization options.
This program is simulating mealy and moore machines.
Web Application for building and testing Automata.
Fundamentals of Computing - Learn through simulation
Automata-Toolbox implements various types of automata, including DFA, NFA, CFG and PDA.
The application is developed in Java, converts any given Regular Expression to Minimised DFA. It follows the path: RE-->NFA-->DFA-->Minimised DFA.
GUI to interact with compiler elements
NFA to DFA conversor.
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.