Finite-State Machine (FSM) for Arduino

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

Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF

Pure-Python library for building and working with nondeterministic finite automata (NFAs).

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

Solutions to practice session exercises from Theory of Algorithms at BUTE.

State machines for Laravel with Enums

A teaching aid for concepts and algorithms in logic

A regular grammar and finite automaton evaluator

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

Deterministic finite automaton

This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)

Finite Automaton

这是一个非常简单小巧的有限自动状态机。使用C++11开发，仅仅由一个头文件构成

Samples of algorithms to verify strings / words using finite machines.

Finite automaton algorithms and turing machine

Interactive website for simulating variants of finite automata, Turing machines with 2D tapes, and k-queue automata

This repository contains a Python program for checking the acceptability of strings in a Finite State Machine (FSM). The program allows users to define the FSM by providing the number of states, inputs, transitions, and final states. It then evaluates user-provided strings to determine if they are acceptable within the specified FSM.

A Non-deterministic Finite Automaton (NFA) based Regular Expression Engine implemented in Scala. Supports basic regex operations, dot operator, and visualization using GraphViz.