Let = {0,1}. Let WWk = {ww
Chapter , Problem 1.69(choose chapter or problem)
Let = {0,1}. Let WWk = {ww| w and w is of length k}. a. Show that for each k, no DFA can recognize WWk with fewer than 2k states. b. Describe a much smaller NFA for WWk, the complement of WWk.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer