This project is an implementation of McNaughton-Yamada and Subset Construction algorithms to translate regular expressions into automatas capable of matching strings.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project is an implementation of McNaughton-Yamada and Subset Construction algorithms to translate regular expressions into automatas capable of matching strings.
License
brunohadlich/regex
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This project is an implementation of McNaughton-Yamada and Subset Construction algorithms to translate regular expressions into automatas capable of matching strings.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published