Automata is an end-of-year project developed during the 2021/2022 academic year at ENSI (Engineering School). Automata is an interactive application designed to build finite automata based on user preferences. The app allows users to visualize the automata's graph and verify it accepts a given word or not.
Este projeto foi desenvolvido para a disciplina SIN 131 - Introdução à Teoria da Computação, da Universidade Federal de Viçosa - Campus Rio Paranaíba, e tem como objetivo a conversão de autômatos finitos não determinísticos (NFA) em autômatos finitos determinísticos (DFA).
Repository for my bachelor thesis and consecutive research on the soliton automata model.
In this project we implement an algorithm provided in the paper "On the Learnability of Shuffle Ideals" which discusses the ability to PAC learn such shuffle ideals in a practical time complexity utilizing statistical queries.
A simple implementation of the paper "Multitask Spectral Learning of Weighted Automata" by Rabusseau et al.
Visualizations of cellular automata
This is final project of Theory-of-Machines-and-Languages
Trabalho 1 de Linguagens Formais e Compiladores (INE5421)
A Cellular Automata visualizer written in Python
Python script to create and test Turring machines
A generator of the 1D automata described by Steven Wolfram in "A New Kind of Science"
Code to construct all equivalences of regular expressions and transition between them.
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."