Finite-State Machine (FSM) for Arduino

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.

A C++ library for simulating automata and Turing machines

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

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.

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

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 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 Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

Simple implementation of deterministic finite automata in OCaml

Deterministic finite automaton

🔍 Simple Java DFA for validating string patterns like Roman numerals and numeric constants.

DFA simulator GUI in Python

Module for OpenKNX: State Maschines for KNX defined as Deterministic Finite Automaton (DFA)

State Machines for KNX configurable via ETS

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