🚦 Declarative Finite-State Machines in Go
A Python package for automata theory.
bison-like Parser generator & Compiler frontend framework that generate optimised IELR(1)/LALR(1) tables with Deterministic LR and Non-Deterministic GLR parsing. Write custom reduce actions in Rust and get beautiful diagnostics out of the box.
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
A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.
Naive GUI app for generating the context-free grammar (CFG) from an input deterministic finite automaton (DFA).
A python CLI tool for creating diagrams of finite state machines.
A tool for testing and simulating Deterministic Finite Machines with string inputs
Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.
Uma ferramenta para criar e validar Expressões Regulares
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…
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 🔄
An interpreter of a compact language for working with Deterministic Finite Automata.
Theory of Computation | Conversion from NFA to DFA
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."