Question 1 is from our textbook, Introduction to Languages and the Theory of Com

Question

Question 1 is from our textbook, Introduction to Languages and the Theory of Computation, fourth edition, by John Martin. 1. Text p. 39 # 1.33c. Also, explain why the left hand side and right hand side are not equal for the example you gave. 2. Let -(a,b). Let Lir(b,a). Let L2"(baa,a,abbbb,bab,b). For each of parts a, b, c below, say whether the given statement is true or false and circle your answer. You should also give a brief justification of your answer for each part. b) L2 SLI c) Li-L2. 3. a) Let -(0,1). Find a regular expression corresponding to the language b) Let = {a,b). Give the language corresponding to the regular expression L-(0,1)(11,000JU(10)" 4. Let ={a,b). Let L be the language consisting of all strings of length at least 2 over whose first and last characters are the different. Give a regular expression corresponding to L

Explanation / Answer

Solution:

Please post the questions completely here, unfortunately, we don't have the books which you refer to. 2, 3, and 4 is solved.

2)

only c is true

Because L2 contains a and b as well which will enumerate strings same as L1.

3)

a)

The regular expression will be

(0|1)(11|000) + (10)*

b)

The language is always starting with aa.

4)

The regular expression will be.

*01) + (10)*

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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