Problem 1 [50 points] For each of the following languages, construct a Turing ma

Question

Problem 1 [50 points] For each of the following languages, construct a Turing machine in JFLAP, version 7, that decides the language. To receive full credit for each language, you must submit three files: (1) the JFLAP file (e.g., 1a.jff); (2) a text file (e.g. la-accept.txt) with five strings that are in the language, one per line; and (3) a text file (e.g., 1a-reject.txt) with five strings that are not in the language, one per line. In total, you should have 9 files. Note that there is no explicit reject state in JFLAP. We assume that there is a transition to the reject state whenever a state lacks an outgoing transition for a particular symbol. a. A-{w | w ? {0.1)" contains twice as many Os as is) b. B-tu, u ? {o. 1)" does not contain an equal number of 0s and 1s}

Explanation / Answer

answer

a)

It is relatively simple.

immediately we have to calculate.

First, we go to the accurate and replace 1 with X.

Now we go left until we get a clear symbol.

following this, we go to the right and reinstate two zeroes with X if existing.

We repeat above ladder until all ones are replace by X or machine halts in amid if it is not possible.

following these steps, we make sure in the string if there are residual zeroes string is not conventional else accepted.

Screenshot:

Turing Machine: take out q6 state as it is unrelated.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.