GitHub - daniboybye/Minimal-Deterministic-Finite-Automaton-from-a-Regular-Expression: Builds the minimal deterministic finite automaton for a regular expression — regex parser, NFA construction, determinisation, and partition refinement with radix sort. C++ coursework for Practical Applications of Finite Automata, Sofia University.

Name		Name	Last commit message	Last commit date
PKA Projct.xcodeproj		PKA Projct.xcodeproj
PKA Projct		PKA Projct
The-unique-minimal-dictionary-whose-language-is-the-French-regular-endings-of-verbs-of 2.png		The-unique-minimal-dictionary-whose-language-is-the-French-regular-endings-of-verbs-of 2.png
The-unique-minimal-dictionary-whose-language-is-the-French-regular-endings-of-verbs-of.png		The-unique-minimal-dictionary-whose-language-is-the-French-regular-endings-of-verbs-of.png
regular expression - large.txt		regular expression - large.txt
regular expression - medium.txt		regular expression - medium.txt
regular expression - small.txt		regular expression - small.txt

About

Builds the minimal deterministic finite automaton for a regular expression — regex parser, NFA construction, determinisation, and partition refinement with radix sort. C++ coursework for Practical Applications of Finite Automata, Sofia University.

automata-theory cpp dfa finite-automata formal-languages minimization nfa regular-expressions sofia-university university-project

Activity

0 stars

0 watching

0 forks

Report repository