|
|
0656a2faf4
|
Visualize DFAs over a finite set of tokens
|
2019-10-31 23:50:54 +00:00 |
|
|
|
e5a9c03bb6
|
Implement DFA minimization
|
2019-10-31 19:10:33 +00:00 |
|
|
|
51dfa176ac
|
Adapt nfaToDfa and dfaToNfa to new types
Also, the files updated so far compile with --pedantic now :)
|
2019-10-30 18:09:30 +00:00 |
|
|
|
e273c8bc75
|
Implement Dfa using Fa
|
2019-10-30 15:19:52 +00:00 |
|
|
|
ae84e1a148
|
Slightly change DFA visualization
Transitions to the same state are now clumped together as one arrow.
|
2019-10-28 13:44:26 +00:00 |
|
|
|
10db66edc0
|
Visualize the automata using GraphViz
|
2019-10-26 18:18:08 +00:00 |
|
|
|
34a3a2027c
|
Rename a DFA's and NFA's states
|
2019-10-26 15:24:36 +00:00 |
|
|
|
c44f4c090b
|
Make constructing NFAs and DFAs more usable
|
2019-10-26 10:12:35 +00:00 |
|
|
|
02bf60b095
|
Add epsilon transitions
|
2019-10-26 10:10:45 +00:00 |
|
|
|
11f0f68513
|
Convert between DFA and NFA
|
2019-10-25 15:06:52 +00:00 |
|
|
|
56bcf2c987
|
Execute DFA and NFA on a list of tokens
|
2019-10-25 09:43:52 +00:00 |
|
|
|
edd7a44d02
|
Add DFA constructor function
Also cleanes up the naming scheme, just like the last commit.
|
2019-10-24 22:40:24 +00:00 |
|
|
|
4cae9af848
|
Add DFA and NFA representations
|
2019-10-24 12:28:47 +00:00 |
|
