Pattern searching by building regexp FSM compiler and corresponding pattern matcher.
-
Updated
Sep 16, 2021 - Java
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.
Pattern searching by building regexp FSM compiler and corresponding pattern matcher.
Maven version of easyfsm library
Transform your FSM (Finite State Machine) to a Regex.
[Innopolis University] Theoretical Computer Science Course 2021. Assignment
A simple state machine library.
Projeto com o intuito de ter um primeiro contato com Inteligência Artificial em jogos.
State machine for Java/Android
Some Android APIs testing.
A library that implements formal finite state automata.
Finite state machine library
Transforms DFA to regex and regex to DFA and NFA. (Finite State Machines) Demonstrate is done using the Kleene theorem. In addition, a comparison is made between the string sizes of the regular expressions obtained from converting DFA with a reduction.
Type-safe abstract trait recorder for 'finite state automata'-like agent
An FSM framework for creating Automaton