A Python package for automata theory.
This repository contains an implementation of DISC, an algorithm for learning DFAs for multiclass sequence classification.
CS Graph editor : Javscript based frontend visual graph editor
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
This is about DFA optimization/Minimization in C program
A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️
Lexical Analyzer , Syntax Analyzer and Semantic Analyzer. using, DFA, FSA, cfgs, regular expressions , will implement different parsers e.g CLR0, LL1 , OPERATOR etc
Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
This is the "one": Linuxy infrastructureish mostly C++ code.
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
This is simple Finite automata implementation which comes with the problem statement of a form having an email input field that- Must end with @diu.edu.bd and validate DIU Students email with some other conditions.
FlyWeight Finite Automata Simulator
Projet CY-Tech
Syntax tree method implementation to convert a regular expression to DFA.
This toolkit integrates lexical and syntax analysis, parsing of regular expressions with token validation and LR(0) diagram generation based on YAPar and YALex files.
Implementation and Simulation of TicTacTie via Deterministic Finite State Automata
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
A C++ library to create, load, and analyze Deterministic Finite Automata (DFA) with up to 10 states and lowercase letter alphabets. Offers file loading, state modification, and string acceptance checks.
Automata implementations
Add a description, image, and links to the dfa-construction topic page so that developers can more easily learn about it.
To associate your repository with the dfa-construction topic, visit your repo's landing page and select "manage topics."