nfa-to-dfa-conversion
There are 118 repositories under nfa-to-dfa-conversion topic.
shushrutsharma/18CSC304J-CD
All the weekly lab work of the subject 18CSC304J Compiler Design.
dejavudwh/Regex
An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）
anaghasethu/KTU-sem7-compilerdesign-programs
KTU 7th Semester Compiler Design lab programs along with algorithms
Reinforz/fauton
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Solawhite/RE2NFA2DFA2MFA
1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings
devangi2000/Compiler-Design
A repository containing all experiments for the course Compiler Design.
Megha-Bose/Automata-Theory-Conversions
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
rollrat/compiler-compiler
🍁 Compiler Compiler based on CSharp with GUI Program
amirkabiri/finite-automata
Graphical interface for designing finite automata
hritikbhandari/NFA-to-DFA-Converter
A Web Application to convert NFA to DFA.
tanmaya0102/Compiler-Design-Programs
Compiler Design Lab Programs
squidscode/apli
The Abstract Programming Language Interface (APLI) is a framework for generating Abstract Syntax Trees (ASTs) to enable developers to create domain-specific languages faster.
Rakibul73/Compiler_Autometa_Code
CIT-412 (Compiler Design and Autometa Theory Sessional)
AmirHossein812002/Regex2FA
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
maggieezzat/Automaton-Theory
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)
mohamadkhalaj/statemachine-app
Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!
nichitaa/formal-languages-and-compiler-design
Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF
igreat/regular-languages-simulator
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 ♻️
KooroshRH/DFA-Machine-Toolbox
A little toolbox that provides detector and converter for DFA machines
Quentin18/fsmdot
Implementation of finite-state machines and exportation to dot format
WrenOswin/Compiler-Lab-CSL411
Experiments done during 7th semester of B.tech CSE for Compiler Lab at KTU
2200031797KavyaA/StateMachineApp
State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.
AmineAgrane/finite-state-automaton-library
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
eraldoforgoli/NFAtoDFAConverter
Theory of Computation | Conversion from NFA to DFA
radinshayanfar/AUT_FLA
AUT Formal Languages and Automata course programming assignment
reity/nfa
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
5okin/NFA-to-DFA
Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)
bl33h/automataGenerator
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
ceenaa/nfa-to-dfa
NFA to DFA Converter and Sequence Validator with python
kulkarniishan/PWA-NFA-to-DFA-converter
This Repo Contains NFA to DFA Converter that takes input from the User, a NFA and then converts it into it's equivalent DFA Showing the Transition Table, Visualization and also Checks the acceptance of a string
nyhead/Finite-Automata-Simulator
NFA to DFA converter, DFA minimization, FA acceptance in Haskell
sharyash81/TLA01-Projects
Midterm project of Theory of languages and automata - Mentorship
theritik01/CD
All the weekly lab work of the subject 18CSC304J Compiler Design.
ZiadSheriif/AutoMajestic
RegEx Visualizer is a powerful tool that allows you to visualize the process of converting regular expressions into Non-deterministic Finite Automata (NFA), Deterministic Finite Automata (DFA), and minimized DFA.