There are 1 repository under deterministic-finite-automata topic.
🚦 Declarative Finite-State Machines in Go
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
Graphical interface for designing finite automata
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 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.
A tool for testing and simulating Deterministic Finite Machines with string inputs
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.
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 technical and scientific basis for the future production of the remaining components, as well as adapted to new technological realities and distribution platforms.
Semester project, the lexical analyzer for a custom compiler. Deterministic Finite Automaton is Implemented in this project.
🔄 Deterministic Finite Automata simulator 🔄
The GeneticDFA project uses genetic programming to reverse engineer blackbox systems modeled in DFA form.
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
An interpreter of a compact language for working with Deterministic Finite Automata.
Turing Machine that simulates behavior of any Deterministic Finite Automata
Theory of Computation | Conversion from NFA to DFA
A parser for regex expressions, converting them to equivalent ER (regular expressions), then to corresponding Nondeterministic & Deterministic Finite-State Machine (NFA & DFA) built for checking validity of given strings.
Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
Simulate a string if it is valid in the deterministic finite automaton (DFA)
regular expression engine based on deterministic finite automata(DFA)
Genetic programming algorithm for automating ant motion
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
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
A simple free-form interpreted language for building Turing machines and other automata
Web application that utilizes Deterministic Finite Automata as a conjunction finder and find patterns
A Qt 5 Python GUI application for converting regular expressions to a finite automaton
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
A set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)