Skip to content
#

finite-state-automata

Star

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.

Here are 13 public repositories matching this topic...

Language: Java
Filter by language
All 83 Python 16 Java 13 C++ 10 JavaScript 8 C# 5 TypeScript 5 C 3 TeX 3 HTML 2 Haskell 2
Sort: Most stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

vinary-tree / liblevenshtein-java

Star 58

Various utilities regarding Levenshtein transducers. (Java)

computer-science search-engine data-science machine-learning natural-language-processing information-retrieval bioinformatics genomics dictionary fuzzy-search computational-biology edit-distance levenshtein-distance approximate-string-matching distance-metric finite-state-automata finite-state-transducer levenshtein-automata spelling-correction universal-automata
  • Updated Dec 20, 2021
  • Java
Followers
27 followers
Website
github.com/topics/finite-state-machine
Wikipedia
Wikipedia

Related topics

automaton deterministic-finite-automaton nondeterministic-finite-automaton