How can I prove that the accepted language of a given DFA or NFA or REGEX is equivalent to a given language

Question

I found this How do I verify that a DFA is equivalent to a NFA? but as it states it is not really a good question more of how can I check myself during an exam. Because as you might know to do this by hand for < 5 states is really hard to do without any mistake and I only get credit for a correct construction and not understanding that REGΣ = NEAΣ = DEAΣ

https://cs.stackexchange.com/q/11315/755 – D.W. Jun 11 '20 at 17:00 — D.W., Jun 11 '20 at 17:00

score 1 · Answer 1 · answered Jun 11 '20 at 14:32

1

Proving such a claim rigorously can be usually done with induction on word length $|w|$.

answered Jun 11 '20 at 14:32

nir shahar

11,538
3
14
35

How can I prove that the accepted language of a given DFA or NFA or REGEX is equivalent to a given language

1 Answers1