Some Theory of Computation Exercises Week 1
|
|
- Augustine Clarke
- 5 years ago
- Views:
Transcription
1 Some Theory of Computtion Exercises Week 1 Section 1 Deterministic Finite Automt Question 1.3 d d d d u q 1 q 2 q 3 q 4 q 5 d u u u u Question 1.4 Prt c - {w w hs even s nd one or two s} First we sk whether w hs n even numer of s, which requires two sttes one to signify tht n even numer of s hs een oserved thus fr, nd one to signify tht n odd numer hve een oserved thus fr: Next we must determine whether w contins precisely one or two s, which needs four sttes: initiliztion, single, two s nd the filure stte, These two devices must now e comined to crete recogniser for their intersection. Every pir of sttes will e represented y single stte in the new device, so we cn ly it out in 4 2 grid thus: 1
2 even s odd s 0 s 1 2 s >2s Notice tht the two sttes in the dotted rectngle cn e comined into single stte, s no sequence of chrcters will llow the device to escpe from the ox nd neither stte is n ccepting stte. Question 1.5 Prt h recognise {w w is ny string except, } As suggested in the question we cn first construct device which recognises the complement of this lnguge, nmely {, }, nd then negte its output to find the solution which we re looking for.,, To negte its output we convert ll the ccepting sttes into rejecting sttes nd vice-vers:,,,, Question 1.6 Prt i {w every odd position is 1} This is similr to the even/odd numer of s required in question 1.4 ove. Here we need gdget to keep trck of whether we re looking t n odd/even numered position, which will hed into n ttrcting filure stte if the position is odd nd is not 1. 2
3 even Here s n odd/even detector, to which we just need to dd the fil stte odd We cn only fil y detecting 0 when the position is odd, so we get something like this: even 1, 0 1 1, 0 Adding tht we ccept if we don t fil odd 0 fil Question multiplying y 3 { ( ) ( ) ( ) ( )} Here Σ = 0 0, 0 1, 1 0, 1 nd we wnt to prove the regulrity of the set of strings from 1 Σ wherein the ottom row is three times the top row, so for exmple: ( 0 0 ( In L Not in L ) ( ) 0 3 = ) 1 3=3 etc Tle 1. Some exmple strings 1 Since we re given tht regulrity of the reverse of lnguge implies the regulrity of the lnguge, we prove tht L is regulr y constructing DFA which recognises the reverse of L, in which the lest significnt it comes first. For the lnguge to e regulr it must e possile to perform the recognition using n mount of memory which doesn t increse with the length of the input (this is where we record our current stte), nd with ccess only to one symol of input t time. Multiplying y 3 definitely hs this property, s we cn work with 1 column t time nd the crry never exceeds 2. For exmple: C C (7) (3) (7 3)
4 Reding this from right to left: =1 + no crry = 1 (output), nd 1 1=1 (new crry stte is 01) =1 + crry (1) = 10, so output is 0 nd C 0 =1 1 1=1, so we re now crrying 2, C 1 = 1 (1 from ove nd 1 from this) =1 + crry (2) = 11 (3), so output is 1 nd C 0 =1 1 1=1, so we re still crrying =0 + crry (2) = 10 (2), so output is 0 nd C 0 =1 1 0=0 = 0 so C 1 = =0 + crry (1) = 1, so output is 1 nd C 0 = 0 1 0=0 = 0 so C 1 = 0 So we need 3 sttes, one for no crry, one for single crry nd one for two crries, nd then for ny vlid trnsition the result it must e the lest significnt it of the sum of the input it nd the current crry. The current crry is then updted to e the most significnt it of the sum of input nd old crry + the input; tht gives us the following DFA. Any missing trnsitions led to n inescple filure stte which I hven t drwn in the interests of prsimony. ( ) 1 1 ( 1 0 ) ( ) 0 0 C = 0 C =1 C =2 ( ) 1 1 ( ) 0 1 ( ) 0 0 So for exmple in C = 2 when we see n input it of 1 we re dding = 3 = 11 to the totl, so we expect to see n output it of 1 (the low it), nd crry of t lest 1 (the high it). We re lso dding 1 1 in the next column, so the crry must remin t 2. Similr rguments hold for ll the other vlid trnsitions. 4
5
6
7
8
9
10 Deterministic Finite Automt 1. Exercises in pges Exercise 1.1. The strt stte of ech mchine is q 1.. The sets of ccept sttes of M 1 nd M 1 re respectively F={q 2 } nd F={q 1,q 4 }. c. M 1 goes through sttes q 1, q 2, q 3, q 1 nd q 1. M 2 goes through sttes q 1, q 1, q 1, q 2 nd q 4. d. M 1 does not ccept the string. M 1 does. e. M 1 does not ccept ε. M 2 does. Exercise 1.2. Forml description of M 1. Σ={,} Q={q 1,q 2,q 3 } F={q 2 } δ is given y q 1 q 2 q 1 q 2 q 3 q 3 q 3 q 2 q 1. Forml description of M 2. Σ={,} Q={q 1,q 2,q 3,q 4 } F={q 3,q 4 } δ is given y q 1 q 1 q 2 q 2 q 3 q 4 q 3 q 2 q 1 q 4 q 3 q 4
11 Exercise 1.3
12 Exercise 1.4. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs t lest three 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 3 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 3 s 2 s 3 s 3 s 3 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w w hs t lest two 's} is s follows: Σ={,} Q 2 ={t 0,t 1,t 2 } q 02 = t 0 F 2 ={t 2 } δ is given y t 0 t 0 t 1 t 1 t 1 t 2 t 2 t 2 t 2
13 The forml definition of mchine M ccepting the lnguge L(M)={w w hs t lest three 's nd t lest two 's} is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 3,t 2 )} δ is given y (s 0,t 0 ) (s 1,t 0 ) (s 0,t 1 ) (s 0,t 1 ) (s 1,t 1 ) (s 0,t 2 ) (s 0,t 2 ) (s 1,t 2 ) (s 0,t 2 ) (s 1,t 0 ) (s 2,t 0 ) (s 1,t 1 ) (s 1,t 1 ) (s 2,t 1 ) (s 1,t 2 ) (s 1,t 2 ) (s 2,t 2 ) (s 1,t 2 ) (s 2,t 0 ) (s 3,t 0 ) (s 2,t 1 ) (s 2,t 1 ) (s 3,t 1 ) (s 2,t 2 ) (s 2,t 2 ) (s 3,t 2 ) (s 2,t 2 ) (s 3,t 0 ) (s 3,t 0 ) (s 3,t 1 ) (s 3,t 1 ) (s 3,t 1 ) (s 3,t 2 ) (s 3,t 2 ) (s 3,t 2 ) (s 3,t 2 )
14 . The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs exctly two 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 2 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 3 s 2 s 3 s 3 s 3 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w w hs t lest two 's} is s follows: Σ={,} Q 2 ={t 0,t 1,t 2 } q 02 = t 0 F 2 ={t 2 } δ is given y t 0 t 0 t 1 t 1 t 1 t 2 t 2 t 2 t 2
15 The forml definition of mchine M ccepting the lnguge L(M 2 )={w w hs t exctly two 's nd t lest two 's} is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 2,t 2 )} δ is given y (s 0,t 0 ) (s 1,t 0 ) (s 0,t 1 ) (s 0,t 1 ) (s 1,t 1 ) (s 0,t 2 ) (s 0,t 2 ) (s 1,t 2 ) (s 0,t 2 ) (s 1,t 0 ) (s 2,t 0 ) (s 1,t 1 ) (s 1,t 1 ) (s 2,t 1 ) (s 1,t 2 ) (s 1,t 2 ) (s 2,t 2 ) (s 1,t 2 ) (s 2,t 0 ) (s 3,t 0 ) (s 2,t 1 ) (s 2,t 1 ) (s 3,t 1 ) (s 2,t 2 ) (s 2,t 2 ) (s 3,t 2 ) (s 2,t 2 ) (s 3,t 0 ) (s 3,t 0 ) (s 3,t 1 ) (s 3,t 1 ) (s 3,t 1 ) (s 3,t 2 ) (s 3,t 2 ) (s 3,t 2 ) (s 3,t 2 )
16 c. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs n even numer of 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2 } q 01 = s 0 F 1 ={s 2 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 1 s 2 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w w hs one or two 's} is s follows: Σ={,} Q 2 ={t 0,t 1,t 2,t 3 } q 02 = t 0 F 2 ={t 1,t 2 } δ is given y t 0 t 0 t 1 t 1 t 1 t 2 t 2 t 2 t 3 t 3 t 3 t 3
17 The forml definition of mchine M ccepting the lnguge L(M)={w w hs n even numer of 's nd one or two 's} is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 2,t 1 ),(s 2,t 2 )} δ is given y (s 0,t 0 ) (s 1,t 0 ) (s 0,t 1 ) (s 0,t 1 ) (s 1,t 1 ) (s 0,t 2 ) (s 0,t 2 ) (s 1,t 2 ) (s 0,t 3 ) (s 0,t 3 ) (s 1,t 3 ) (s 0,t 3 ) (s 1,t 0 ) (s 2,t 0 ) (s 1,t 1 ) (s 1,t 1 ) (s 2,t 1 ) (s 1,t 2 ) (s 1,t 2 ) (s 2,t 2 ) (s 1,t 3 ) (s 1,t 3 ) (s 2,t 3 ) (s 1,t 3 ) (s 2,t 0 ) (s 1,t 0 ) (s 2,t 1 ) (s 2,t 1 ) (s 1,t 1 ) (s 2,t 2 ) (s 2,t 2 ) (s 1,t 2 ) (s 2,t 3 ) (s 2,t 3 ) (s 1,t 3 ) (s 2,t 3 )
18 d. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs n even numer of 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2 } q 01 = s 0 F 1 ={s 2 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 1 s 2 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w in w ech is followed y t lest one } is s follows: Σ={,} Q 2 ={t 0,t 1,t 2,t 3 } q 02 = t 0 F 2 ={t 0,t 2 } δ is given y t 0 t 1 t 0 t 1 t 3 t 2 t 2 t 1 t 2 t 3 t 3 t 3
19 The forml definition of mchine M ccepting the lnguge L(M)={w w hs n even numer of 's nd ech is followed y t lest one } is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 0,t 0 ),(s 0,t 2 )} δ is given y (s 0,t 0 ) (s 1,t 1 ) (s 0,t 0 ) (s 0,t 1 ) (s 1,t 3 ) (s 0,t 2 ) (s 0,t 2 ) (s 1,t 1 ) (s 0,t 2 ) (s 0,t 3 ) (s 1,t 3 ) (s 0,t 3 ) (s 1,t 0 ) (s 2,t 1 ) (s 1,t 0 ) (s 1,t 1 ) (s 2,t 3 ) (s 1,t 2 ) (s 1,t 2 ) (s 2,t 1 ) (s 1,t 2 ) (s 1,t 3 ) (s 2,t 3 ) (s 1,t 3 ) (s 2,t 0 ) (s 1,t 1 ) (s 2,t 0 ) (s 2,t 1 ) (s 1,t 3 ) (s 2,t 2 ) (s 2,t 2 ) (s 1,t 1 ) (s 2,t 2 ) (s 2,t 3 ) (s 1,t 3 ) (s 2,t 3 ) 2. Not included in this solution sheet.
20 . The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs n odd numer of 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2 } q 01 = s 0 F 1 ={s 1 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 1 s 2 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w w ends with } is s follows: Σ={,} Q 2 ={t 0,t 1 } q 02 = t 0 F 2 ={t 1 } δ is given y t 0 t 0 t 1 t 1 t 0 t 1
21 The forml definition of mchine M ccepting the lnguge L(M)={w w hs n odd numer of 's nd ends with } is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 1,t 1 )} δ is given y (s 0,t 0 ) (s 1,t 0 ) (s 0,t 1 ) (s 0,t 1 ) (s 1,t 0 ) (s 0,t 1 ) (s 1,t 0 ) (s 2,t 0 ) (s 1,t 1 ) (s 1,t 1 ) (s 2,t 0 ) (s 1,t 1 ) (s 2,t 0 ) (s 1,t 0 ) (s 2,t 1 ) (s 2,t 1 ) (s 1,t 0 ) (s 2,t 1 ). The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w hs n even length} is s follows: Σ={,} Q 1 ={s 0,s 1 } q 01 = s 0 F 1 ={s 0 } δ is given y s 0 s 1 s 1 s 1 s 0 s 0
22 The forml definition of mchine M 2 ccepting the lnguge L(M 2 )={w w hs n odd numer of 's} is s follows: Σ={,} Q 2 ={t 0,t 1,t 2 } q 02 = t 0 F 2 ={t 1 } δ is given y t 0 t 1 t 0 t 1 t 2 t 1 t 2 t 1 t 2 The forml definition of mchine M ccepting the lnguge L(M)={w w hs n even length nd n odd numer of 's} is s follows: Σ={,} Q=Q 1 Q 2 q 0 = (s 0,t 0 ) F =F 1 xf 2 ={(s 0,t 1 )} δ is given y (s 0,t 0 ) (s 1,t 1 ) (s 1,t 0 ) (s 0,t 1 ) (s 1,t 2 ) (s 1,t 1 ) (s 0,t 2 ) (s 1,t 1 ) (s 1,t 2 ) (s 1,t 0 ) (s 0,t 1 ) (s 0,t 0 ) (s 1,t 1 ) (s 0,t 2 ) (s 0,t 1 ) (s 1,t 2 ) (s 0,t 1 ) (s 0,t 2 )
23 Exercise 1.5. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w contins the sustring } is s follows: Σ={,} Q 1 ={s 0,s 1,s 2 } q 01 = s 0 F 1 ={s 2 } δ is given y s 0 s 1 s 0 s 1 s 1 s 2 s 2 s 2 s 2 A mchine M 2 ccepting the lnguge L(M 2 )={w w does not contin the sustring } is defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q- F 1 ={s 0,s 1 }.. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w contins the sustring } is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3,s 4 } q 01 = s 0 F 1 ={s 4 } δ is given y s 0 s 0 s 1 s 1 s 2 s 1 s 2 s 0 s 3 s 3 s 4 s 1 s 4 s 4 s 4
24 A mchine M 2 ccepting the lnguge L(M 2 )={w w does not contin the sustring } is defined y the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 0,s 1,s 2,s 3 }. c. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w contins either the sustring or } is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 3 } δ is given y s 0 s 1 s 2 s 1 s 1 s 3 s 2 s 3 s 2 s 3 s 3 s 3 A mchine M 2 ccepting the lnguge L(M 2 )={w w contins neither the sustring or } is defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q- F 1 ={s 0,s 1,s 2 }.
25 d. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string in **} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3,s 4 } q 01 = s 0 F 1 ={s 0,s 1,s 2,s 3 } δ is given y s 0 s 1 s 2 s 1 s 1 s 3 s 2 s 4 s 2 s 3 s 4 s 3 s 4 s 4 s 4 A mchine M 2 ccepting the lnguge L(M 2 )={w w is ny string not in **} is defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 4 }.
26 e. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string in (+)*} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 0,s 3 } δ is given y s 0 s 2 s 1 s 1 s 1 s 1 s 2 s 1 s 3 s 3 s 2 s 3 A mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string not in (+)*} is defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 1,s 2 }. f. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string in *U*} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 0,s 1,s 2 } δ is given y s 0 s 1 s 2 s 1 s 1 s 3 s 2 s 3 s 2 s 3 s 3 s 3
27 A mchine M 2 ccepting the lnguge L(M 2 )={w w is ny string not in *U*} defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 3 }. g. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string tht contins exctly two 's} is s follows: Σ={,} Q 1 ={s 0,s 1,s 2,s 3 } q 01 = s 0 F 1 ={s 2 } δ is given y s 0 s 1 s 0 s 1 s 2 s 1 s 2 s 3 s 2 s 3 s 3 s 3 A mchine mchine M 2 ccepting the lnguge L(M 2 )={w w is ny string tht doesn't contin exctly two 's} defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 0,s 1,s 3 }.
28 h. The forml definition of mchine M 1 ccepting the lnguge L(M 1 )={w w is ny string or } is s follows: Σ={,} Q 1 ={s 0,s 1,s 2 } q 01 = s 0 F 1 ={s 1 } δ is given y s 0 s 1 s 1 s 1 s 2 s 2 s 2 s 2 s 2 A mchine M 2 ccepting the lnguge L(M 2 )={w w is ny string except nd } is defined y the sme lphet, the sme sttes, the sme trnsition function, the sme strt stte nd set of ccept sttes F 2 =Q-F 1 ={s 0,s 2 }. Exercise 1.6 ) {w w egins with 1 nd ends with zero}.
29 ) {w w contins t lest three 1s} c) {w w contins the sustring 0101} d) {w w hs length t lest three nd its third symol is 0}
30 e) {w w strts with 0 nd hs odd length, or strts with 1 nd hs even length} f) {w w doesn't contin the sustring 110}
31 g) {w the length of w is t most 5} h) {w w is ny string except 11 nd 111} i) {w every odd position of w is 1}
32 j) Not included in this solution sheet. k) {empty,0} l) Not included in this solution sheet. m) The empty string. n) Any string except the empty string.
33 2. For ech of the following regulr expressions, drw DFA recognizing the corresponding lnguge. ) (0 U 1)*110* ) (11 U 10)* c) (1 U 110)*0
34 3. Not included in this solution sheet. 4.
35 Nondeterministic Finite Automt Exercise 1.11 Given NFA M 1 =(Q 1, Σ 1, S 01, F 1, δ 1 ) construct NFA M 2 =(Q 2, Σ 2, S 02, F 2, δ 2 ) s follows (given tht F 1 ={f 1, f 2, f 3,..., f n }). Q 2 =Q 1 Σ 2 =Σ 1 S 02 = S 01 F 2 ={f k }, 1 k n δ 2 =δ 1 plus the mppings δ(f, ε)={f k }, for every f F 1 nd f F 2. Exercise 1.14 ) Given NFA M 1 =(Q 1, Σ 1, S 01, F 1, δ 1 ) if the ccept sttes re swpped the result is new NFA M 2 =(Q 2, Σ 2, S 02, F 2, δ 2 ) with the following definitions: Q 2 =Q 1 Σ 2 =Σ 1 S 02 = S 01 F 2 =Q 1 -F 1 δ 2 =δ 1 The fct tht the set of ccept sttes of M 2 (F 2 ) is the complement of F 1 it gurntees tht M 2 ccepts only those words tht re not ccepted y M 1, i.e., the complement lnguge of M 1. ) The following NFA recognises the lnguge L={w w is }.
36 The following mchine ws constructed y swpping the ccept sttes of the previous ut it doesn't ccept the lnguge L={w w is not }.
Homework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationRegular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene-*
Regulr Expressions (RE) Regulr Expressions (RE) Empty set F A RE denotes the empty set Opertion Nottion Lnguge UNIX Empty string A RE denotes the set {} Alterntion R +r L(r ) L(r ) r r Symol Alterntion
More informationWorked out examples Finite Automata
Worked out exmples Finite Automt Exmple Design Finite Stte Automton which reds inry string nd ccepts only those tht end with. Since we re in the topic of Non Deterministic Finite Automt (NFA), we will
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationNon Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51
Non Deterministic Automt Linz: Nondeterministic Finite Accepters, pge 51 1 Nondeterministic Finite Accepter (NFA) Alphbet ={} q 1 q2 q 0 q 3 2 Nondeterministic Finite Accepter (NFA) Alphbet ={} Two choices
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationCSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science
CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny
More informationCISC 4090 Theory of Computation
9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationFinite-State Automata: Recap
Finite-Stte Automt: Recp Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 09 August 2016 Outline 1 Introduction 2 Forml Definitions nd Nottion 3 Closure under
More informationCHAPTER 1 Regular Languages. Contents
Finite Automt (FA or DFA) CHAPTE 1 egulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, euivlence of NFAs nd DFAs, closure under regulr
More informationDeterministic Finite Automata
Finite Automt Deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion Sciences Version: fll 2016 J. Rot Version: fll 2016 Tlen en Automten 1 / 21 Outline Finite Automt Finite
More informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationNon-Deterministic Finite Automata. Fall 2018 Costas Busch - RPI 1
Non-Deterministic Finite Automt Fll 2018 Costs Busch - RPI 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q q2 1 q 0 q 3 Fll 2018 Costs Busch - RPI 2 Nondeterministic Finite Automton (NFA) Alphbet
More informationCHAPTER 1 Regular Languages. Contents. definitions, examples, designing, regular operations. Non-deterministic Finite Automata (NFA)
Finite Automt (FA or DFA) CHAPTER Regulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, equivlence of NFAs DFAs, closure under regulr
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationFinite Automata-cont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationNon-deterministic Finite Automata
Non-deterministic Finite Automt Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd T. vn Lrhoven Institute for Computing nd Informtion Sciences Intelligent
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationConverting Regular Expressions to Discrete Finite Automata: A Tutorial
Converting Regulr Expressions to Discrete Finite Automt: A Tutoril Dvid Christinsen 2013-01-03 This is tutoril on how to convert regulr expressions to nondeterministic finite utomt (NFA) nd how to convert
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationChapter 2 Finite Automata
Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014
CS125 Lecture 12 Fll 2014 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationNFAs continued, Closure Properties of Regular Languages
Algorithms & Models of Computtion CS/ECE 374, Fll 2017 NFAs continued, Closure Properties of Regulr Lnguges Lecture 5 Tuesdy, Septemer 12, 2017 Sriel Hr-Peled (UIUC) CS374 1 Fll 2017 1 / 31 Regulr Lnguges,
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationTalen en Automaten Test 1, Mon 7 th Dec, h45 17h30
Tlen en Automten Test 1, Mon 7 th Dec, 2015 15h45 17h30 This test consists of four exercises over 5 pges. Explin your pproch, nd write your nswer to ech exercise on seprte pge. You cn score mximum of 100
More informationTheory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38
Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control
More informationLet's start with an example:
Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte
More informationCS 311 Homework 3 due 16:30, Thursday, 14 th October 2010
CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w
More informationNon-Deterministic Finite Automata
Non-Deterministic Finite Automt http://users.comlb.ox.c.uk/luke. ong/teching/moc/nf2up.pdf 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q1 q2 2 Alphbet ={} Two choices q1 q2 3 Alphbet ={} Two choices
More informationFormal Language and Automata Theory (CS21004)
Forml Lnguge nd Automt Forml Lnguge nd Automt Theory (CS21004) Khrgpur Khrgpur Khrgpur Forml Lnguge nd Automt Tle of Contents Forml Lnguge nd Automt Khrgpur 1 2 3 Khrgpur Forml Lnguge nd Automt Forml Lnguge
More informationTheory of Computation Regular Languages
Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationChapter 1, Part 1. Regular Languages. CSC527, Chapter 1, Part 1 c 2012 Mitsunori Ogihara 1
Chpter 1, Prt 1 Regulr Lnguges CSC527, Chpter 1, Prt 1 c 2012 Mitsunori Ogihr 1 Finite Automt A finite utomton is system for processing ny finite sequence of symols, where the symols re chosen from finite
More informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:35-9:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationLecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
More informationFormal languages, automata, and theory of computation
Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm
More informationNon Deterministic Automata. Formal Languages and Automata - Yonsei CS 1
Non Deterministic Automt Forml Lnguges nd Automt - Yonsei CS 1 Nondeterministic Finite Accepter (NFA) We llow set of possible moves insted of A unique move. Alphbet = {} Two choices q 1 q2 Forml Lnguges
More informationAnatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute
Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn
More informationLanguages & Automata
Lnguges & Automt Dr. Lim Nughton Lnguges A lnguge is sed on n lphet which is finite set of smols such s {, } or {, } or {,..., z}. If Σ is n lphet, string over Σ is finite sequence of letters from Σ, (strings
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationNon-deterministic Finite Automata
Non-deterministic Finite Automt From Regulr Expressions to NFA- Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationCS 330 Formal Methods and Models
CS 0 Forml Methods nd Models Dn Richrds, George Mson University, Fll 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 8 1. Prove q (q p) p q p () (4pts) with truth tle. p q p q p (q p) p q
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More information11.1 Finite Automata. CS125 Lecture 11 Fall Motivation: TMs without a tape: maybe we can at least fully understand such a simple model?
CS125 Lecture 11 Fll 2016 11.1 Finite Automt Motivtion: TMs without tpe: mybe we cn t lest fully understnd such simple model? Algorithms (e.g. string mtching) Computing with very limited memory Forml verifiction
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationNFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce
More informationChapter 4 Regular Grammar and Regular Sets. (Solutions / Hints)
C K Ngpl Forml Lnguges nd utomt Theory Chpter 4 Regulr Grmmr nd Regulr ets (olutions / Hints) ol. (),,,,,,,,,,,,,,,,,,,,,,,,,, (),, (c) c c, c c, c, c, c c, c, c, c, c, c, c, c c,c, c, c, c, c, c, c, c,
More informationFormal Languages and Automata
Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationFundamentals of Computer Science
Fundmentls of Computer Science Chpter 3: NFA nd DFA equivlence Regulr expressions Henrik Björklund Umeå University Jnury 23, 2014 NFA nd DFA equivlence As we shll see, it turns out tht NFA nd DFA re equivlent,
More informationTuring Machines Part One
Turing Mchines Prt One Wht problems cn we solve with computer? Regulr Lnguges CFLs Lnguges recognizble by ny fesible computing mchine All Lnguges Tht sme drwing, to scle. All Lnguges The Problem Finite
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tle of Contents: Week 1: Preliminries (set lger, reltions, functions) (red Chpters 1-4) Weeks
More information80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES. 2.6 Finite State Automata With Output: Transducers
80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES 2.6 Finite Stte Automt With Output: Trnsducers So fr, we hve only considered utomt tht recognize lnguges, i.e., utomt tht do not produce ny output on ny input
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationCS:4330 Theory of Computation Spring Regular Languages. Equivalences between Finite automata and REs. Haniel Barbosa
CS:4330 Theory of Computtion Spring 208 Regulr Lnguges Equivlences between Finite utomt nd REs Hniel Brbos Redings for this lecture Chpter of [Sipser 996], 3rd edition. Section.3. Finite utomt nd regulr
More informationNFAs continued, Closure Properties of Regular Languages
lgorithms & Models of omputtion S/EE 374, Spring 209 NFs continued, losure Properties of Regulr Lnguges Lecture 5 Tuesdy, Jnury 29, 209 Regulr Lnguges, DFs, NFs Lnguges ccepted y DFs, NFs, nd regulr expressions
More informationJava II Finite Automata I
Jv II Finite Automt I Bernd Kiefer Bernd.Kiefer@dfki.de Deutsches Forschungszentrum für künstliche Intelligenz Finite Automt I p.1/13 Processing Regulr Expressions We lredy lerned out Jv s regulr expression
More informationIn-depth introduction to main models, concepts of theory of computation:
CMPSCI601: Introduction Lecture 1 In-depth introduction to min models, concepts of theory of computtion: Computility: wht cn e computed in principle Logic: how cn we express our requirements Complexity:
More informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tble of Contents: Week 1: Preliminries (set lgebr, reltions, functions) (red Chpters 1-4) Weeks
More informationRevision Sheet. (a) Give a regular expression for each of the following languages:
Theoreticl Computer Science (Bridging Course) Dr. G. D. Tipldi F. Bonirdi Winter Semester 2014/2015 Revision Sheet University of Freiurg Deprtment of Computer Science Question 1 (Finite Automt, 8 + 6 points)
More informationThoery of Automata CS402
Thoery of Automt C402 Theory of Automt Tle of contents: Lecture N0. 1... 4 ummry... 4 Wht does utomt men?... 4 Introduction to lnguges... 4 Alphets... 4 trings... 4 Defining Lnguges... 5 Lecture N0. 2...
More informationTable of contents: Lecture N Summary... 3 What does automata mean?... 3 Introduction to languages... 3 Alphabets... 3 Strings...
Tle of contents: Lecture N0.... 3 ummry... 3 Wht does utomt men?... 3 Introduction to lnguges... 3 Alphets... 3 trings... 3 Defining Lnguges... 4 Lecture N0. 2... 7 ummry... 7 Kleene tr Closure... 7 Recursive
More informationCSCI 340: Computational Models. Transition Graphs. Department of Computer Science
CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationFinite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh
Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, section 003, George Mson University, Fll 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 7 1. Prove (p q) (p q), () (5pts) using truth tles. p q
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationSection: Other Models of Turing Machines. Definition: Two automata are equivalent if they accept the same language.
Section: Other Models of Turing Mchines Definition: Two utomt re equivlent if they ccept the sme lnguge. Turing Mchines with Sty Option Modify δ, Theorem Clss of stndrd TM s is equivlent to clss of TM
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationinput tape head moves current state
CPS 140 - Mthemticl Foundtions of CS Dr. Susn Rodger Section: Finite Automt (Ch. 2) (lecture notes) Things to do in clss tody (Jn. 13, 2004): ffl questions on homework 1 ffl finish chpter 1 ffl Red Chpter
More informationE 1 (n) = E 0 (n-1) E 0 (n) = E 0 (n-1)+e 0 (n-2) T(n -1)=2E 0 (n-2) + E 0 (n-3)
cs3102: Theory of Computtion Clss 5: Non-Regulr PS1, Prolem 8 Menu Non-regulr lnguges Spring 2010 University of Virgini Dvid Evns PS1 Generl Comments Proofs re for mking convincing rguments, not for ofusction.
More informationMidterm 1 Practice. CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/
Midterm 1 Prctice CS 350 Fll 2018 gilry.org/clsses/fll2018/cs350/ 1 Midterm #1: Thursdy, Septemer 27! Bring less stuff, if possile. Keep ny gs under the tle. You my hve out: pencil, pen, nd/or erser. My
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More information1.3 Regular Expressions
56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,
More informationSWEN 224 Formal Foundations of Programming WITH ANSWERS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Time Allowed: 3 Hours EXAMINATIONS 2011 END-OF-YEAR SWEN 224 Forml Foundtions of Progrmming
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationCompiler Design. Fall Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
University of Southern Cliforni Computer Science Deprtment Compiler Design Fll Lexicl Anlysis Smple Exercises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sciences Institute 4676 Admirlty Wy, Suite
More informationCSC 311 Theory of Computation
CSC 11 Theory of Computtion Tutoril on DFAs, NFAs, regulr expressions, regulr grmmr, closure of regulr lnguges, context-free grmmrs, non-deterministic push-down utomt, Turing mchines,etc. Tutoril 2 Second
More information3 Regular expressions
3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll
More informationFABER Formal Languages, Automata and Models of Computation
DVA337 FABER Forml Lnguges, Automt nd Models of Computtion Lecture 5 chool of Innovtion, Design nd Engineering Mälrdlen University 2015 1 Recp of lecture 4 y definition suset construction DFA NFA stte
More informationDeterministic Finite-State Automata
Deterministic Finite-Stte Automt Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 12 August 2013 Outline 1 Introduction 2 Exmple DFA 1 DFA for Odd number of
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More information