OCaml code to construct an NFA from a regular expression
-
Updated
Aug 5, 2020 - OCaml
OCaml code to construct an NFA from a regular expression
Resolução dos problemas de Teoria de Computação 2019/2020
Basic implementation of Finite Automaton (DFA, NFA) with for basic compiler written in OCaml.
Variations around Savitch's Theorem
Expressão regular para autômato finito não determinístico
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."