[General boards] [Fall 2018 courses] [Summer 2018 courses] [Winter 2018 courses] [Older or newer terms]

Do we need to write the forml proof of equivalence of regex, DFA, NFA in exam?


#1

Do we need to prove the equivalence between the regex, DFA, NFA like lecture slices 11 did?


#2

It’s a really long proof…


#3

I don’t think so. However, I think it is likely we will need to prove the equivalence of some specific DFAs, NFAs, & regular expressions.