Question

roblem 18 [15 points Consider the Turing M (Q,E, T,6,4, F), such that 16 g transition set (d) Write a regular expresion that defitves L. fsuch a regular expression does mot exist, prove it Answer: E, N,t,1, R (M has an one-way infinite tape (infinite to the right only.) B is the designated blank symbol. M accepts by final state.) Let L be the set of strings which M accepts Let LR be the set of strings which M rejects. Let Lee be the set of strings on which M diverges. (a) List four distinct strings that belong to L. If this is impossible, state it and explain why it is so. (e) Write a regular expression that defines Ln. If such a regular expression does not exist, prove it. Answer (b) List four distinct strings that belong to LR. If this is impossible, state it and explain why it is so. Answer: (f) Write a regular expression that defines Lo. If such a regular expression does not exist, prove it. Answer: (c) List four distinct strings that belong to Loo If this s impossible, state it and explain why it is so. iswer:

Answer 1

,1R 丿凸 R. B,B A, ODA O DR 七 tIR BBR L wil be all thotestrs ou whih with number of zenoes must be ocld o 00D DDD. Stops OoO

oLev enCe e au Machi Loops Loraver