in Theory of Computation
335 views
1 vote
1 vote

Let $\sum=\{0,1\}.$ Let $WW_{k}=\{ww|w\in \sum^{*}$ and $w$ is of length $k\}.$

  1. Show that for each $k,$ no DFA can recognize $WW_{k}$ with fewer than $2^{k}$ states.
  2. Describe a much smaller $NFA$ for $\overline{WW_{k}},$ the complement of $WW_{k}.$
in Theory of Computation
by
335 views

Please log in or register to answer this question.

Related questions