🚦 Declarative Finite-State Machines in Go

Finite State Machine Library for .NET Core (with EASY and ADVANCED implementation)

🧫 A complex cellular automaton which simulates an entire ecosystem : universe, flora and fauna.

A Python package for automata theory.

A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method

Turing Machine that simulates behavior of any Deterministic Finite Automata

Simulates path of a given DFA using a state diagram

Graphical interface for designing finite automata

A simple program to create DFAs and test them

Naive GUI app for generating the context-free grammar (CFG) from an input deterministic finite automaton (DFA).

An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

A document sharing server-client architecture similar to Google Document

Theory of Computation | Conversion from NFA to DFA

The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc

In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)

Deterministic Finite Automata parser for my Theory of Computation class.

DFA (Deterministic Finite Automata)

FSM Generator is a simple web application that allows you to generate finite state machines (FSM) / Deterministic Finite Automata (DFA) from regular expressions.