-1
$\begingroup$

is it necessary that number of states in minimal DFA for a language corresponding to L' is equal to the number of states in minimal DFA of the language corresponding to L.

here L' is the complement of the language L.

for example, number of states in the minimal DFA for the language

L={set of all string containing 01 and 011 as the substring over the alphabet {0,1}}

is 4.

if i'm making the DFA for the complement of this language, i'm getting 3. but is it true that it should be 4?

please help!! which one is correct-- 3 or 4?

$\endgroup$

closed as off-topic by Aryeh, Gamow, David Eppstein, Emil Jeřábek, Kristoffer Arnsfelt Hansen Jan 8 at 21:20

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Aryeh, Gamow, David Eppstein, Emil Jeřábek, Kristoffer Arnsfelt Hansen
If this question can be reworded to fit the rules in the help center, please edit the question.

Browse other questions tagged or ask your own question.