Go package for working with deterministic/non-deterministic finite automata and grammars for regular and context-free languages.
-
Updated
May 8, 2024 - Go
Go package for working with deterministic/non-deterministic finite automata and grammars for regular and context-free languages.
A program that constructs the sets of FIRST, NEXT and CHOICE
Encoding Agnostic Validation (Validation Language, Parsers and Encoders)
A program for generating cellular automata.
Implementation of Deterministic Finite Automata using Go
A simple finite state machine implementation
Deterministic and nondeterministic finite automata and regular expressions in Go.
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."