A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
A program that takes a regular expression and creates an NFA that accepts it. The description of an NFA should be compatible with a NFA 2 DFA program, which means that it can be translated into a form that can be run on a DFA simulator.
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
Add a description, image, and links to the regex-to-nfa topic page so that developers can more easily learn about it.
To associate your repository with the regex-to-nfa topic, visit your repo's landing page and select "manage topics."