A Theory of Computation mini project in progress using Java and JavaFX GUI.
Graph Theory Project - (G00356519)
A Java program that can emulate various computational models
A Python program that uses an NFA to check if a regular expression matches a given string
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
Finite-state machines for Rust
Resolução dos problemas de Teoria de Computação 2019/2020
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.
A simple, but powerful Regular Expression recognizer
Curso tomado en la ESCOM, con el Maestro Norman Rafael Saucedo.
Maximize revenues of Online Retail Business with Thompson Sampling algorithm
Library on Multi-armed bandit
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
implementation of automata in r7rs scheme
正则表达式转NFA，DFA，最小DFA
Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)
1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings
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."