Can anyone make a C/C++ program to minimise the DFA and showing states with transition for any given regular expression?? | Sololearn: Learn to code for FREE!
New course! Every coder should learn Generative AI!
Try a free lesson
0

Can anyone make a C/C++ program to minimise the DFA and showing states with transition for any given regular expression??

Like if we input a regular expression (ab)* then the output should be menu driven for NFA, DFA and minimised DFA, all showing with state table.

21st Oct 2019, 3:42 PM
smaxiso
smaxiso - avatar
1 Answer
+ 1
Try to attempt by yourself first?
21st Oct 2019, 4:00 PM
A͢J
A͢J - avatar