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)
Web application to manage finite state machine!
Generate NFA and DFA definitions from natural-language requests, visualize the automata, and run them via a Python application
Collection of useful agents to quickly generate/analyze finite automata diagrams
React rewrite of my third-year project from university, an educational tool for finite automata. Currently in development.