Question: Oops!. . . ilon did it again. Professor has helpfully given you several statements and claimed proofs about DFAs and Turing machines. Unfortunately ( but
Oops!. ilon did it again.
Professor has helpfully given you several statements and claimed proofs about DFAs and
Turing machines. Unfortunately but unsurprisingly all of them are wrong at least one way!
For each statement, explain whether it is "well formed"ie it uses terminology correctly, and
is either true or false. If it is not well formed, describe a small 'repair' that would make it well
formed, and captures s likely intent. Finally, explain whether the claimed proof is logically
valid for the possibly repaired statement.
a Statement: any DFA with alphabet whose states are all accepting states accepts the
language
Claimed proof: no matter what the input string is the DFA remains in an accepting
state throughout its computation, so it eventually accepts the string. Therefore, the DFA
accepts every string over the alphabet which proves the claim.
b Statement: there is a DFA with alphabet that decides the language
: prime
Claimed proof: we describe such a DFA It has a state for each nonnegative integer
and s only transition for the single alphabet character is to state The
initial state is and the accepting states are exactly those where is prime. One can
see that when run on an arbitrary input string ends up at state ; so it accepts
if is prime, and rejects otherwise. Therefore, decides
c Statement: Let be a Turing machine, and be the same Turing machine but with
the accept and reject states swapped. Then the language of is ie the
complement of the language of
Claimed proof: Because the accept and reject states are swapped, rejects every
string that accepts, and accepts every string that rejects. So since
are by definition the sets of strings that accept respectively we conclude that
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
