This project will contain some programs about automatons, free context languages and Turing machines
-
Updated
Jan 3, 2018 - Python
This project will contain some programs about automatons, free context languages and Turing machines
Regular Expressions to Deterministic Finite Automatons parser, used to obtain the minimum DFA, and also to check which strings are accepted by a given NFA.
A CLI program that converts an input Non-Deterministic Finite Automaton into a Deterministic Finite Automaton.
Python command line interface finite automaton reader (Up to pushdown automata).
This repository focuses on studying and showcasing interesting patterns emerging from simple rules random motion algorithms. It contains a Conway's Game of life made in Python and a second algorithm for an animation of random walk algorithms on a 2D plane.
Add a description, image, and links to the automatons topic page so that developers can more easily learn about it.
To associate your repository with the automatons topic, visit your repo's landing page and select "manage topics."