A somewhat sophisticated regular expression parser utilizing a finite automata
-
Updated
Jan 18, 2020 - C++
A somewhat sophisticated regular expression parser utilizing a finite automata
Program for proving elementary algebraic (perspective - geometry) theorems using distributed computations
Formal Requirements Toolkit
NFA (nondeterministic finite automaton) simulator using C++
Add a description, image, and links to the formal-language topic page so that developers can more easily learn about it.
To associate your repository with the formal-language topic, visit your repo's landing page and select "manage topics."