A program to convert the given regular expression to Non Deterministic Automata (NFA) then NFA to Deterministic Automata (DFA)
Input: Regular expression (Infıx)
Current Output: NFA Transition Table & Epsilon Closures
Next Output: DFA Table
This repository has been archived by the owner on Jan 27, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
A program to convert the given regular expression to Non Definite Automata (NFA) then NFA to Definite Automata (DFA) via C++
License
lapestand/Regular-expression-to-NFA-to-DFA
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
A program to convert the given regular expression to Non Definite Automata (NFA) then NFA to Definite Automata (DFA) via C++
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published