An experimental framework for helping eliminate boilerplate when building state machines.
-
Updated
Feb 27, 2017 - Go
An experimental framework for helping eliminate boilerplate when building state machines.
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
Deterministic Finite Acceptor (DFA) for known cryptocurrency addresses using GO.
Lex machinary for go.
Statecraft is a state machine compiler that generates Go code and graphviz dot files from a simple DSL.
String matching algorithms written in go
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."