21 skills found
BurntSushi / Regex AutomataA low level regular expression library that uses deterministic finite automata.
marianobarrios / Dregexdregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
KendallHopkins / FormalTheoryRegular Expression (Regex), Nondeterministic finite automaton (NFA) and Deterministic finite automaton (DFA) implement in PHP.
vinyasns / Dfa To RegexA Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method
moar-regex / MoarDeterministic Regular Expressions with Backreferences
prijatelj / Thompson ConstructionJava implementation of Thompson Construction Algorithm for converting regular expressions into non-deterministic finite automata (NFAs)
atulrulers / Regx To NfaA c++ program to convert regular expression into Non-deterministic finite automata (NFA) using Thompson's construction.
pranavraj / AutomataPlusA Theory of Computation (TOC) tool written purely in python to check and experiment with TOC concepts. It has functionalities which allows users to work with both deterministic and non deterministic automata, regular expressions, turing machines etc.
LetMeFly666 / Re2DFARegular expression to DFA(Deterministic Finite State) | 正则表达式转最小化DFA
TomC333 / Regex To DfaRegular Expression To Deterministic Finite State Automata
tonievictor / RexenCompile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
iordachebogdan / RegexToDFAConverterC++ application that converts regular expressions into Deterministic Finite Automata.
yyypasserby / RE2DFA VisualizationA handy tool to visualize the process that converts Regular Expression (RE) to Nondeterministic Finite Automaton (NFA), Deterministic Finite Automaton (DFA) and Minimized Deterministic Finite Automaton (min-DFA).
niemaattarian / Thompsons Construction On NFAsI was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text
phiresky / Dfa2regexConverts Deterministic finite automata to regular expressions.
txus / LibregRegular expressions library implemented as non-deterministic finite-state automata.
JustinChaney2023 / Plc AssignmentA Python implementation of Regular Expression recognition and DFA (Deterministic Finite Automaton) simulation.
3breadt / UPB ADT Automata ToolsThe "Automata Tools" library implements finite state automata (deterministic and non-deterministic), regular expressions and regular grammar related functions. The library is developed as part of the lecture "Verlässliches Programmieren in C/C++" of the department Angewandte Datentechnik at the Uni Paderborn.
npathai / JavaFAThis is a project aimed at creating Finite State Machines or Deterministic Finite Automata for Regular Expression matching. It aims at reducing the time of matching as least as possible.
harishr1308 / RegextoNFAConverting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL
