The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
10 views

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}.$
asked in Theory of Computation by Boss (40k points) | 10 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,587 questions
54,197 answers
187,535 comments
71,151 users