Around 35 of the fastest and most widely used full text search algorithms. Written in c, compiled with llvm.clang for iOS and everything else. Boyer-Moore , Knuth-Morris-Pratt, Reverse Colussi even the Zhu-Takaoka algorithm. And 32 more.

Finite-State Machine (FSM) for Arduino

A C++ library for simulating automata and Turing machines

Semester project, the lexical analyzer for a custom compiler. Deterministic Finite Automaton is Implemented in this project.

Converting a deterministic finite automaton to a minimal one.

Python implementation of a Deterministic Finite Automaton (DFA) with interactive testing. Verify input string acceptance and explore language processing concepts

finite state machine or deterministic finite automata in c++20 template

A simple free-form interpreted language for building Turing machines and other automata

Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

Implementation of a DFA in C++. The program can read, show, minimize and export a DFA. Besides, it can show the dead states and analyze a string to see if it belongs to the DFA.

"implementation of a Deterministic Finite Automaton (DFA). Includes classes for defining and processing DFAs, with parsers for JSON, Text File, Dictionary and String formats."

Simple implementation of deterministic finite automata in OCaml

Deterministic finite automaton

Репозиторий для задач по курсу "скрипты"

DFA simulator GUI in Python

Fiddling with some Deterministic and Nondeterministic Final State Automata, as inspired by the "Theoretical Computing" subject in uni.

Please read the Design Report.

Automata Simulator: DFA & NFA

Tool for converting a non deterministic finite automaton to a deterministic one.