Finite Automaton

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

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

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 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)

State machines for Laravel with Enums

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.

A teaching aid for concepts and algorithms in logic

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

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

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

A C++ library for simulating automata and Turing machines

Finite-State Machine (FSM) for Arduino