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.
Software Engineering @ FMI
Processing Formal Languages and Automata Package
Simulators for Finite Automaton, Pushdown Automaton, and Turing Machine. Explore computational theory interactively!
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.
Deterministic finite automaton
Library for finite-state machines, also known as automatons, in Kotlin.
Automatos Finitos deterministicos (AFD) e não determinicos (AFND).
Formal Control Toolbox
Work in the Discipline of Theory of Formal Languages and Automaton - UFMT
A 2D game including an artificial intelligence
Automaton Finite Builder based on NodeJS. The application allows to create an automaton finite through the console or terminal. You can set multiple states and transitions, also it allows you to evaluate multiple strings.
Neckerworld is a computer game designed to teach and explore human and computer vision.
Todo o conteúdo produzido para a unidade curricular TCOM (Teoria da Computação), para o curso em Engenharia Informática e Computação na FEUP
Aplicación básica de teoría de autómatas para la implementancion de expresiones regulares, corriendo en una pagina web.
Deterministic Finite Automaton analyzer using JFlex
Work in the Discipline of Theory of Formal Languages and Automaton - UFMT
This project will contain some programs about automatons, free context languages and Turing machines
A CLI program that converts an input Non-Deterministic Finite Automaton into a Deterministic Finite Automaton.
