Reactive State Machine Framework for Arduino

This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.

A C++ library for simulating automata and Turing machines

Levenshtein distance implementation using an automaton and a trie for fast string similarity searching

An esoteric programming language based on Turing Machines

[“形式语言与自动机”实验：给定任意上下文无关文法，将其转换为Greibach范式，再转换为NPDA，并能验证给定句子是否属于该文法。][Given an context-free grammar, convert it to Greibach paradigm, then to NPDA(i.e. Non-deterministic PushDown Automaton), and verify whether any sentence belongs to the grammar.]

WireWorld celluar simulation

fml is a C++ template library for formal method: automaton, regular expression, logic.

This project is a fusion of robotics and computer vision, utilizing Arduino Uno R3 and OpenCV to automate object sorting by color. It showcases innovative technology while emphasizing our commitment to sustainability and responsible innovation.

Um programa que lista os tokens de uma linguagem de programação definida.

A simple program to create DFAs and test them

Deterministic finite automaton

A very fast and low memory usage C++ automaton tokenizer that breaks an input string into a list of tokens looking at tabs, spaces, new lines, and detects special tokens like numbers, prces, personal noms, emails, lexemes, etc. It allows to specify delimeters and detect special cases.

C++ Cellular automaton ( GoL, Brian Brain's, Griffiths model, FireForest )

Yet Another Parser

Smallest positive integer N such that N%k == 0 using set S

Class to create and run automatons

Conway's cellular automaton, 'Game Of Life', created using C++'s SFML library. 📉👾📈

Tasks about C++, SQL, Finance & Trading.

C++ console program for validating regular expressions