A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of states at any given time.
The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.
An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.
In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
Theory of machines and languages course project.
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Quantum Finite Automata simulators implementations in Python.
Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
Command line tool for generating JFLAP files containing random FA's.
👨🏽💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Finite Automaton
Finite automata program made from a combination of two sub-programs, namely the lexical analyzer program and the parser program, this program will test a series of words in English.
🐝 Spelling Bee's project is a Web Application for the Da Vinci Code Game.
Design a pharmacy vending machine using Finite State Machines.
🖨️ Formal Languages and Compiler Design Uni Laboratory tasks
Automatizované testování a dynamická analýza - Projekt - Implementace monitoru pro RV - Řízení vozíku v robotické továrně
Fork of leapfrogdevelopment/rstr from bitbucket
A program which reads user input (in terms of functions containing 2 parameters) and produces the equivalent mathematical expression.
Lexical and Syntax Analyzer
Theory of languages and automata projects in forth semester of university
Algoritimo para teste de automatos finitos deterministicos e não deterministicos utilizando python.