regex-to-dfa

converting regex (regular expression) to DFA directly by creating syntax tree in java

Compiles RegExes into an NFA, optionally into an very fast DFA, and returns the longest match without backtracking. RegEx IDs identify which of several concurrent RegExes matched — ideal for lexers, yet flexible for other uses.

Deteministic Finite Automaton Implementation in Python Language

A program that can take a regex as input and return a deterministic finite automaton that recognises the same language.

Automata project that will convert given regular expressions to DFA and CFG to PDA.

A simple regex compiler which converts the regular expression into a dfa which can be simulated to check if a string matches the pattern...

Generate a string from regex using java. Firstly transfrom regex to nfa to dfa then create a new string from regex

Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular

Regular expression to finite state automaton conversion

Syntax tree method implementation to convert a regular expression to DFA.

A comprehensive single tape Turing Machine simulator.

Regex to DFA assignment - FTC PUC Minas 2024