Online Deep Learning: Learning Deep Neural Networks on the Fly / Non-linear Contextual Bandit Algorithm (ONN_THS)

Regular expression engine in Python using Thompson's algorithm.

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

正则表达式转NFA，DFA，最小DFA

Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)

Library on Multi-armed bandit

Adaptive Advanced Tree Search function designed for OpenWeb-UI

implementation of automata in r7rs scheme

Maximize revenues of Online Retail Business with Thompson Sampling algorithm

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 Thompson's Algorithm based RegEx to NFA compiler, implemented in Julia.

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

A simple, but powerful Regular Expression recognizer

Curso tomado en la ESCOM, con el Maestro Norman Rafael Saucedo.

Simple regex engine implementation.

Resolução dos problemas de Teoria de Computação 2019/2020

peruser is a text-search command-line tool that uses regular expression matches to find patterns in text.

A Theory of Computation mini project in progress using Java and JavaFX GUI.

Graph Theory Project - (G00356519)