Aotoma 60 Trolustricl Ret Mores Tere Gui Gjilarm Toll 19:00 a& \2:00F > euenben F alldbde; St palowa; Il Slt combrienprite X Ege * Sequitne ie very; "rede ke Chene (Universe) Leds ingungeen’y Les* JL} :Crdipplidode de Ln de Hegel sub seq vinci. ne ST el, ASEL + $5. =} S= ee Fedno A pea U=(ces": tues) ns op edlyo lepelaele et ito fechada- Le lth > er Lol=$>L. Fecho de Vleone, oD {E30LULLULLL... Ly Pts EX" {4} Bolenrate : dis basitive caer Av vebresentar linguagenn uy Conjunto de Estados Zi Cohtunle. de Eventos, Ge =(KEL 7 x0, Xm) {4 Sk tuncéo oe Hamvices ole Estadn Tx-22% {Oh gab dos events ahva> Ye: erbado inicial Yi hada morcades aaa ok tami cdo de erbadess eeerE @” x fe at flyad=x es=fa9} of bgt {yey My)-fa,b} a9 ao x yg? )Ffabg} {9-3 (B.b)-3 Xw=f{z St fx, De £Ba)=F(a,9)=S Zoe X E seal eslendur © dominte dl £ awn X«S* oF L(a,t)=% Wee X Al Neo llc L(x, RE £90), ¥s6B% VES. Debinidefole)=fe est fxs) & delinided = £o(&) $4n(@)={s E dole): ae s)E Xmp Pe = +@ Estados a. Blogueio: Ng Hie oO Dead locke 8 -Live Lect © Nets @D3 Eyicle um blog veio ee Laml@) Cfol 6) n Lom + G Blebelfl ele Ele), nis hk elados de pee teh Avtdmeatos 123% Nore ORS Tae — G(X ELT 22, Xnn) 1c® xX faet} Lin a)=F Mle} | Bilce a Knotty )et rie é Ec) Aj f(EerT M1)=ee Qe Ole: Bald | LF = Xm fb X= fhm F Fat PCA,b)= Fa £(Rn,Ce.)-A oO HE ® Exfoeite} Levan f(hab)= Fa le Yor A (atke Pa)=b P(dn)=fk,53 Mar Gm CEG C (En) feebvl tab oOo bbe Comideamdo Comamdos CT) @*e "®@ Descomiduramclo Comam dos at \ ob te oS © oe Sot OO Pr@2® Ober acies com autdmckts — Undwier )Packe Rearsiel, Ae (6)=(Xne,2r, facrloe, ze, Xone ) Xeer{x€X{qs€ fol lx-fxslh fac =f \yc nat 7 XactE* Xone Tae * Xae 27 @Q*o-+-® Deed lock \ Je Ne - ti Lect — Estado nao accssivel a > ay*> = @53 Hi) Pade Concemal, Cole (6) (ene Efe cece, Zeca, Yn) Yor {xe Gses*)[tose ond} cone § bysenets” 7 Xeme® EM Xeswe Teae +] Keone =r? 2 = Estade nao conceasivel Zeme™ | Ae, $0 2a € Xeove } = Estado oi bleguio indabinido, ce to $ Xeene iii) Trin (6) * Ae (Cote (6) = Coe (de (G))iv) Comblamenle dir G, Gcorp > do (Geng) "5" \dom(6) og | FELL S DNSrletel Chg 26-0305" Peibae ule asso |: Criay um estado Xd aN Jk Passo 2: Comble ter foam © Panso Bi Dnverler an merca. goer Aule Fallends: Yojeseo, brodube e combesi¢éo. Execeici9: Demanshre qve lle. =P tL). LOL Beetles 2h (tAL,)\A, Az {s:se(Na)IRGy-tteu) (L\Li)\Ae bbe PANEL PULYOR(L)= (LU AL)O(LLUA) PRIL)L WA, =(L,0L.)UAUA2= LiL, Pack de Le nao rove dwel on le Parle de li nto brovetive l am Le ’ Combosi¢zo beralele delelh uyPopes BC Se Piao Lm? fa,6,g, 0} OAL OcO Vec\eedo Bletgact Le {a,b wah: O4OAOSS) Proegzo Plaka) QSQS@SG Tae 3354S Comfesiceo pareleler : = eb Og On operas <9 858 a (6,03) & He 9 Lon (GIG) = . ‘dole lor ‘(Lo(6.)) lb Srfavsh 4,7 fab, 9} Faso autimate controlador spares a Filoseles Spurtands : O25 80 ec ese CO 2 oe 5 se eReExercicio: Feger a CombosigZo Realda ve O46 6 re tay oO ra meee Reds de Bri A ohrutu re Cored) de oma rede de Rh £0 cary (pte @ TRe/R) Prenjonte des lugares Trariont dea Test ich O legen REPT AN | Ponpoos he ovreas | framnién Rd: TxP?N ordineivigs > atew ordinérias Extealne QO Prat Re@p)-1 Bulen)-o let tb BT} RA o RtGg)-2 tin icoes: Evdtager ec sation. TG) =ftET ‘Ret Cy, br vo 3 Las): {piEP Re (9:,4;)203 Ol ={EET: Pre (pi,h) >0 3 (4) {Pie P: Pout (Ej; )>0} Reds de Pele Hacadon: & uma quinuble (, 1 %i,Bh x) cm que (PT, Pre Pal) e a ator da cede ¢ PON € uma fungéo de Martozoo.2X(0,) | Velor Je marcagas $ »-|)] Z@)} Zen" eye pel [7 12 [x u { Oe beamnigao tj chile oer hobllidada Guan do xe) | x lpi)7Pre (ost) ps ELC) Dinnmicn da ve cle da Reb Soja K Uma tanigéo \ubilitada poe Uma Mavcaga x. Quenko Ly Asbo, ume nova aa 2 é obbide: Z(Pi)= (pi) + Pout (di, Bi) Pre (pr, 45), ¥pr eP. bquaszo de nkade de UmA rede ja Pekyi Pola o hisbero dk 4: xa [e@ik [e@ol« Fa Ce iE te Feels, “sl mi Leet By Ay we x= HA) um vet Ao OM: rate) de incidincia de| sald A’: walla As incidiveian Me tr ada A: ma tig dn Incidivction seleLbde X7 Xt hu, %=X thy, = Xothe+ Ao, Xs? Xz+ Aus = Xo tAuetAu, + Av. ja AL Xu Xa tA ug = Xe +Ayot Av, Av, + Au,> Xe +A usveustus)Fineéo de. amsigan de urna rede de Vb fNuT ON" x lexs) fieex L(y, s1)=C(flxs),) eT MeT Conjunto dk eatados olcamgaiea REPT e/Pat, x) [= {YEN Ase OO, 9*4) Weed de. Pobi fetta day E uma octubla (OT ReRal, xo, E,L, Xoo) et ds Teri ‘ oniunto oe wartes ubligades tua a volWlagen dar intormacea LPee ea Panag “ae ant on q Conjonte Ok vlades maccades’ NOTA* Um meme eles bodk ser crsodiads a fhueo ov marr tramnagoes Seip Nvina rede oe Peet voblada: dat2.1 Answer true or false. (The notation e* is shorthand for {e}*.) (a) aearbrarh EX bb aa E* 4) (b) bra" Na"b* =a" Ub ) () anced =0E* ( (d) ) aed € (ol) € (eles bY(E(eaD(€eve)E” (v) 2, and Ly. Assume that ¢ € Ls and that L2 is an infinite Ly, then Ly = LiLs. 2.2 Consider three languages L: set. Show that if Ly 23. Two lang Ly and Ly are said to be nonconflicting if TiN = Give an example of two conflicting languages. L CK issaid to be closed relative to K, or simply K-closed, if L = TAK. (a) Show that if L; is K-closed for i = 1,2 then so is L1 La. (b) Show that if Ly = Zq and we define Lam = La OK, then Lam is K-closed. Prove the following properties of natural projections. (a) P-(AU B) = P“*(A)UP>(B) (b) P(AB) = P(A)P(B) Prove or disprove by finding a counter-example: If A and B are prefix-closed, then P(ANB) = P(A) PCB). PlavB= s€St: (HE (nuale-Pa)} sEar((edvares\iera} = fc h(a A)U-Pra)tulse Ste BE=Pe))} = P(a)uP'® PUB)= : eae fee asy(e- Pes AB {sezn(g EA aren bey Ple)-Pear)=4 Raber Pcaw)= PLAYPCR) Plaow)= {4 e2%(as€ (are) (t=Pes)} = {Le Bs AcE AQseB\E-Pos))} = {te Se: (1s€A)(4Pi lh [te BAER (L= Rig) } =P(a)oP®)_— (v)27 Construct a omaton that marks the following language {s.€ {a,b}" seach o in sis immediately preceded and fllowed by ab} 28 A combination lock for a safe is designed based on two symbols only, 0 and 1. TI ~~ ‘combination that opens the safe consists of exactly four symbols such thatthe last to are the same (cither two 0's ot two I's). Ifthe combination is not correct, an alarm sounds. Construct a finite-state automaton to describe the process of trying to open the sae Build automata for My, Ma, and the robot arm described in Problem 1.3 of Chap. 1 gS (Chose pyscaly meaning sae for stem components and an vet set that + captures the behavior of individual components as well as their coupling in the system.) 2.10. A computer processor is preceded by’ a quewe that ean accommodate one job only, so that the total capacity of this system is two jobs. Two different job types request service from the processor, and type 1 has higher priority than type 2. Thus, if a type 1 job arrives and finds a type 2 job in service, it preempts it; the type 2 job is returned to the queie and the type 1 job receives service, If any job arrives and finds the system fll, it rejected and lst. Build an automaton model of this system, 2.11 A computer system operates with two parallel processors P, and Ps. The total eapacity (queue and server inchuded) of P, is Ky = 1, and that of Py is Ky = 2. The system receives two types of jobs, labeled J and Js. Jobs of type J mist be processed at P,, and jobs of type Jz must be processed at P. When a job is processed, the system. If job finds a fall queve upon arrival, then the job is simply rejected Build an automaton model ofthis system. eaves rol mechanism in many’ DES is a timeont, wh aie Aree tate cane i — forced to take place when a “timeout event” occurs. Suppose a computer processor 2 ‘operates as follows. When a job arrives, it is broken down into two tasks. Fist, take bo Tis execited, and, if exceution is stccessfully completed, then task 2 i executed, If the execution of task 2 is also successfully completed, then the job is done and it 2. 1 Ieeves the ate, I, however, tak | tale too long, 8 timeout crete generated t ‘and the entire job leaves at onee. Similarly, if task 2 takes too long, another time- RE ‘one jb. Four events are requ to md! this proces JOB-ARWAL, SUCCESS PUL-COMPLETION.OF-TASK-1, SUCCESSFUL. COMPLETION.OP TASK 2, “TIMEOUT Based on this set of events, build an automaton to represent this process (three states should sulice) 25 Foreach of thestate transition diagrams shown in Fig. 2.9, construct a simple quencing model and provide a physical description ofthe proces it represents. Be sre to define ‘each event stands for in your queueing, models,