Deterministic and nondeterministic finite automata and regular expressions in Go.
-
Updated
Sep 26, 2018 - Go
Deterministic and nondeterministic finite automata and regular expressions in Go.
An Abstract Deterministic Finite State Machine/Transducer
regular expression engine based on deterministic finite automata(DFA)
Minimalistic deterministic finite automaton for my university class and for learning go, capable of running simple word acceptance tests. Not feature complete and only for educational reasons.
Implementation of Deterministic Finite Automata using Go
🚦 Declarative Finite-State Machines in Go
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."