ARSDIGITA VNIVERSITY Month 8: Theory of Computation Que 01 - Frof Shai Semonsen 1. Finite State Machines. (5 points) Consider the folowing NFA over the alphabet (0.1) dito 2. Conest thie NEA to a minimal DEA, 1b. White a regular expression forthe set the machine accepts ©. Write alinear gramenae where each right side s ofthe fore aB ora (Ca? a trminal and “2” a nom tama to generate the set, 2. More Machines. (5 points) avr a fie state machine that cepts the complemect cfthe language accepted ly the cen-cleteaministic machine below ~OAO4O 3. Regular or Not, Here I Come. (15 poinis) Deters and prove foreach sete whether eis Regular crwet, Be earefal a. The set ofall auings in which every third sytcbo isthe same a the Est sym in he sting The set 780°, for em and n greater than ot equalto one The set of strings where each stray has an equal miraber of 0's and I's, and every prefix ofthe sing has at most one more 0 than 1, and at mast one move 1 thas 0, 4 Closure, (10 poists) Deternine whether Regular cete ate cloced user each of the operations below. Brove your answers by an explanation and/or exawaple or commerexaznple 1. Eres(Z) isthe set ofall singe x in suc that ois even, 1. Trple(L) = (a | zm, such that, ware in TL, and f= =e) 5. Decision Algorithms. (5 poin=) Give adecision agent to determine whether a regular Janguage L1 has one or more stings in common with the language described by the regular pression [00 + 11 + (01 + 1OXO0-+ 1D>(01 + 10)