DFA NFA automate

[capa57]

Bonjour, j'ai une question en math discrètes, j'y comprends pas grand choses, quelqu'un pourrait m'aider ?

voici la question

Show that, if M is a DFA that recognizes language B, swapping the accept and
nonaccept states in M yields a new DFA that recognizes the complement of B
(;)*\B). Conclude that the class of regular languages is closed under complement

need help

[geegee]

Bonjour, j'ai une question en math discrètes, j'y comprends pas grand choses, quelqu'un pourrait m'aider ?

voici la question

Show that, if M is a DFA that recognizes language B, swapping the accept and
nonaccept states in M yields a new DFA that recognizes the complement of B
(;)*\B). Conclude that the class of regular languages is closed under complement

need help

Bonjour,

for DFA machines, L(M1) complement L(M2) is
L(M1 complement M2)