Software Engineering @ FMI

Processing Formal Languages and Automata Package

A simple and custom grep command implementation using automatons

Deterministic finite automaton

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.

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.

A 2D game including an artificial intelligence

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

A CLI program that converts an input Non-Deterministic Finite Automaton into a Deterministic Finite Automaton.

Deterministic Finite Automaton analyzer using JFlex

Work in the Discipline of Theory of Formal Languages ​​and Automaton - UFMT

Aplicación básica de teoría de autómatas para la implementancion de expresiones regulares, corriendo en una pagina web.

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.

This project will contain some programs about automatons, free context languages and Turing machines

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

Automatos Finitos deterministicos (AFD) e não determinicos (AFND).

Kotlin programs that emulate the available automatons

[PORTUGUÊS] Trabalho de Linguagens Formais e Autômatos para a faculdade