This repository contains the two projects developed in the formal languages and automata theory class. Both projects are developed in Haskell. The first one (DFA2Regex) is basically an algorithm to convert a deterministic finite state Automata to its corresponding regular expression. The second one uses regular expressions to build an organized data base (.CSV file) from a very messy .txt file downloaded from Wikipedia with information about famous mathematicians .
-
Notifications
You must be signed in to change notification settings - Fork 0
simonfallon/Automata-EAFIT
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains the two projects developed in the formal languages and automata theory class
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published