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"-i.e., 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 ={1} that decides the language
L={1p:pis prime }
Claimed proof: we describe such a DFA P. It has a state qn for each non-negative integer
n0, and qn's only transition (for the single alphabet character 1) is to state qn+1. The
initial state is q0, and the accepting states are exactly those qp where p is prime. One can
see that P, when run on an arbitrary input string 1k, ends up at state qk; so, it accepts
if k is prime, and rejects otherwise. Therefore, P decides L.
(c) Statement: Let M be a Turing machine, and M' be the same Turing machine but with
the accept and reject states swapped. Then the language of M' is L(M')?b=ar(L(M)), i.e., the
complement of the language L(M) of M.
Claimed proof: Because the accept and reject states are swapped, M' rejects every
string that M accepts, and accepts every string that M rejects. So, since L(M),L(M')
are by definition the sets of strings that M,M' accept (respectively), we conclude that
L(M')?b=ar(L(M)).
Oops!. . . ilon did it again. Professor has

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!