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!
Novo curso! Todo programador deveria aprender IA generativa!
Experimente uma aula grƔtis
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.

c++regular-expressions
21st Oct 2019, 3:42 PM
smaxiso
smaxiso - avatar
1 Resposta
+ 1
Try to attempt by yourself first?
21st Oct 2019, 4:00 PM
AĶ¢J
AĶ¢J - avatar

Costuma ter perguntas como essa?

Aprenda de maneira mais eficiente, de graƧa:

Ver todos os cursos
Quente hoje
[SOLVED] How to create animation in Python?
2 Votes
How to stop pop up menu from qt table horizontal header
0 Votes
[Clearified] 0 === -0 and 0 == -0
3 Votes
What next?
0 Votes
please help me emotionally
1 Votes
Popsicle program
1 Votes
Why are not all the codes showing?
0 Votes
While loop problem maybe?
2 Votes
Which programming language is most important for learning hacking or cybersecurity?
0 Votes
Why 'null >= 0' is TRUE?
2 Votes