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
Simulators for Finite Automaton, Pushdown Automaton, and Turing Machine. Explore computational theory interactively!
Processing Formal Languages and Automata Package
Deterministic finite automaton
Formal Control Toolbox
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.
Library for finite-state machines, also known as automatons, in Kotlin.
Kotlin programs that emulate the available automatons
Automatos Finitos deterministicos (AFD) e não determinicos (AFND).
A 2D game including an artificial intelligence
Work in the Discipline of Theory of Formal Languages and Automaton - UFMT
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.
Work in the Discipline of Theory of Formal Languages and Automaton - UFMT
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
Neckerworld is a computer game designed to teach and explore human and computer vision.
Deterministic Finite Automaton analyzer using JFlex
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.
3° Trabalho desenvolvido durante a disciplina de Construção de Compiladores 2020.1 do curso de Ciência da Computação da Universidade Federal de Roraima