🚦 Declarative Finite-State Machines in Go

A Python package for automata theory.

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

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

Graphical interface for designing finite automata

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

Finite Automata and Regular Expressions for Regular Languages in Haskell

GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action

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

Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.

A tool for testing and simulating Deterministic Finite Machines with string inputs

Uma ferramenta para criar e validar Expressões Regulares

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

The GeneticDFA project uses genetic programming to reverse engineer blackbox systems modeled in DFA form.

🔄 Deterministic Finite Automata simulator 🔄

The "Automata Learning Lab da Universidade Aberta (UAbALL)" strives to be an integrated laboratory for simulation of Automata. A first phase focused on building the base and introducing the Simulation of Deterministic Finite Automata (DFA). This Laboratory intends to enjoy the capacity of extensibility and adaptability, being this document a tec…

A python CLI tool for creating diagrams of finite state machines.

An interpreter of a compact language for working with Deterministic Finite Automata.

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