16 skills found
dejavudwh / RegexAn implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）
kyx0r / PikevmRuss Cox/Rob Pike pikevm regex implementation
KendallHopkins / FormalTheoryRegular Expression (Regex), Nondeterministic finite automaton (NFA) and Deterministic finite automaton (DFA) implement in PHP.
DavidSkrundz / RegexA pure Swift NFA implementation of a regular expression engine
etnichols / Nfa To DfaNFA to DFA Conversion Implementation in C++.
ziprandom / Crystal DfaA Crystal Implementation of a Thompson NFA/DFA Regex Matcher
prijatelj / Thompson ConstructionJava implementation of Thompson Construction Algorithm for converting regular expressions into non-deterministic finite automata (NFAs)
alexvetter / LibAutomatonSimple Java implementation for PDA, DFA and NFA.
shinbatsu / Kleene TheoremA proof illustrating Kleene’s theorem: a language is regular if it can be represented by a finite automaton or a regular expression.
amb007 / Cl AutomatonA Common Lisp DFA/NFA implementation with Unicode, derived from http://www.brics.dk/automaton/.
JarLoz / JavaRegExpJava implementation of Thompson's NFA-based RegExp matching algorithm for Data Structures Project course
kengz / MachinesTuring Machines and their restrictions: DFA, NFA, PDA etc, implemented in JavaScript. The design is polymorphic to show the restrictions on Turing Machine.
AyoubOuarrak / Finite State MachineC++ implementation of the DFA, NFA and e-NFA
maggieezzat / Automaton TheoryA 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)
kkdai / E Nfaε-NFA: Epsilon-Nondeterministic finite automaton implement in Go
adam-mcdaniel / Regex EngineA Regex📋 implementation in C++ using Thompson's NFA algorithm
