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.
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
A fast and simple automata library
Graphical interface for designing finite automata
Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
PHP script with web interface that can optimize & draw your finite automata
An Elm app for building and simulating deterministic and non-deterministic finite automata (DFAs and NFAs).
Collection of my solutions to the finite automata course (2016 version) offered by Stanford.
Theory of machines and languages course project.
A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.
Front-end Platypus compiler implemented in C. Includes Buffer, Scanner, and Parser. Platypus is a language comprised of parts from a variety of other languages.
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
Fundamental computing machines implemented in Clojure.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Web application to manage finite state machine!
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
A teaching aid for concepts and algorithms in logic
Repozitorijum sadrži materijale sa časova vežbi iz predmeta Prevođenje programskih jezika na Matematičkom fakultetu.