1 votes 1 votes Let $\sum=\{0,1\}.$ Let $WW_{k}=\{ww|w\in \sum^{*}$ and $w$ is of length $k\}.$ Show that for each $k,$ no DFA can recognize $WW_{k}$ with fewer than $2^{k}$ states. Describe a much smaller $NFA$ for $\overline{WW_{k}},$ the complement of $WW_{k}.$ Theory of Computation michael-sipser theory-of-computation finite-automata proof descriptive + – admin asked Apr 30, 2019 admin 335 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.