finite-automata
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 12 public repositories matching this topic...
A utility tool used for validating regular expressions corresponding to a provided word
-
Updated
Sep 11, 2020 - C++
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
-
Updated
Apr 28, 2020 - C++
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
-
Updated
Dec 30, 2017 - C++
Deterministic finite automaton
-
Updated
Apr 22, 2021 - C++
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
-
Updated
May 11, 2021 - C++
A simple C++ library to simulate Finite Automata.
-
Updated
Oct 25, 2022 - C++
A model verifier for finite automata written in C++
-
Updated
Jul 2, 2018 - C++
Naive Algorithm, Rabin-Karp Algorithm, Finite Automata Algorithm, KMP Algorithm.
-
Updated
Jan 27, 2021 - C++
Non-deterministic Finite Automata to Deterministic Finite Automata converter
-
Updated
Feb 26, 2020 - C++
-
Updated
Mar 19, 2023 - C++
Project for the university course Formal Languages and Automata Theory. The code implements a Mealy Machine using C++.
-
Updated
Mar 9, 2024 - C++
- Followers
- 25 followers
- Wikipedia
- Wikipedia