Finite-state machines for Rust
-
Updated
Mar 18, 2024 - Rust
Finite-state machines for Rust
A Theory of Computation mini project in progress using Java and JavaFX GUI.
regular expressions and deterministic and non-deterministic finite automata - simulator and analysis software
Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)
正则表达式转NFA,DFA,最小DFA
Thompson is Python package to evaluate the multi-armed bandit problem. In addition to thompson, Upper Confidence Bound (UCB) algorithm, and randomized results are also implemented.
Library on Multi-armed bandit
implementation of automata in r7rs scheme
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc
Maximize revenues of Online Retail Business with Thompson Sampling algorithm
Curso tomado en la ESCOM, con el Maestro Norman Rafael Saucedo.
A simple, but powerful Regular Expression recognizer
Regular expression engine in Python using Thompson's algorithm.
Resolução dos problemas de Teoria de Computação 2019/2020
A Python program that uses an NFA to check if a regular expression matches a given string
Graph Theory Project - (G00356519)
Online Deep Learning: Learning Deep Neural Networks on the Fly / Non-linear Contextual Bandit Algorithm (ONN_THS)
Add a description, image, and links to the thompson-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the thompson-algorithm topic, visit your repo's landing page and select "manage topics."