Deterministic simulation of a NFA with k symbol lookahead
|
|
- Marianna Stevenson
- 6 years ago
- Views:
Transcription
1 Deteministic simultion of NFA with k symbol lookhed SOFSEM 7 Bl Rvikum, Clifoni Stte Univesity (joint wok with Nic Snten, Univesity of Wteloo)
2 Oveview Definitions: DFA, NFA nd lookhed DFA Motivtion: utomted e sevice composition nd delegtion The NFA delegtion model, exmples, popeties Chcteiztion of existence of delegto Complexityof finding delegto fo unmbiguous nd genel NFA An lgoithm fo genel NFA delegtion Conclusion, futhe wok
3 DFA Deteministic Finite Automton A = Q,, δ, s, F δ : Q ( ) ~ Q s s { } ( ) ( ) ( ) L A w w = Σ is odd = +
4 NFA Nondeteministic Finite Automton δ : Q (,, δ,, ) P( Q) M = Q s F,, s s s s 3 ( ) = ( + ) ( ) ( + ) L A
5 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 symbol lookhed 3 4 5
6 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
7 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
8 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
9 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
10 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
11 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
12 k symbols Lookhed DFA D= Q,, δ, s, F δ : Q ( ) k ~ Q 3 4 5
13 E Sevices Composition nd Delegtion tsk tsk tsk tsk... i i+ i+ i+ 3 e-sevice... seve Bsed on the "sttus" of evey e-sevice, the seve disptches the next tsk i to e-sevice j. Ech e-sevice i my be modeled by n ctivity utomton A, nd evey tsk by symbol fom finite lphbet. i... e-sevice e-sevice j
14 E Sevices Composition nd Delegtion tsk tsk tsk tsk... i i+ i+ i+ 3 e-sevice... seve Bsed on the "sttus" of evey e-sevice, the seve disptches the next tsk i to e-sevice j. Ech e-sevice i my be modeled by n ctivity utomton A, nd evey tsk by symbol fom finite lphbet. i... e-sevice e-sevice j
15 Composition nd Delegtion Models A: epesents vlid sequences of tomic tsks (e.g. web session) A: ctivity utomton fo specific e-sevice i i A; A,..., A is composble if ( ) ( )# ( )#...# ( ) L A L A L A L A (e.g. xyby b # xyy ) This is necessy condition to ensue tht the web ppliction is fesible. Question: is it sufficient?
16 Composition nd Delegtion Models A: epesents vlid sequences of tomic tsks (e.g. web session) A: ctivity utomton fo specific e-sevice i i A; A,..., A is composble if ( ) ( )# ( )#...# ( ) L A L A L A L A (e.g. xyby b # xyy ) This is necessy condition to ensue tht the web ppliction is fesible. Question: is it sufficient?
17 Composition nd Delegtion A : q q q q q A : p p p 3 4 A... : p p A ( A #...# A ) A : p p ( q, p, p,..., ) ( q, p, p,..., p) ( q3, p, p,..., p) p ( q, p, p,..., p ) ( q p, p,..., p ) 4 5,
18 Composbility nd Delegtion 3 4 A : q q q q q 5 : A p p p 3 4 A... : p p A ( A #...# A ) A : p p.., ) (,,,..., ) 3 ( q, p, p,. p q p p p ( q, p, p,..., p ) ( q, p, p,..., p ) ( q p, p,..., p ) 4 5,
19 Composbility nd Delegtion 3 A : q q q q 4 q 5 : p A p p 3 4 A... : p p A ( A #...# A ) A : p p ( q, p, p,..., p ) (, p, p,..., p ) ( q,,,..., p ) q 3 p p ( q, p, p,..., p ) ( q p, p,..., p ) 4 5,
20 Composbility nd Delegtion A : q q 3 q3 q4 q 5 : A p p p 3 4 A... : p p A ( A #...# A ) A : p 3 p.., ) (, p, p,..., p ) 3 ( q4, p p,..., p ) ( q, p, p,. p q ( q, p, p,..., p ) 3, ( q p, p,..., p ) 5, 3
21 Nondeteministic Delegto A : q q q q q A : p p A : p p... 4 p 3 4 A ( A #...# A ) A : p 3 p ( q, p, p,..., p ) ( q, p, p,..., p ) (, p, p,..., p ) q 3 3 q4 p p p 4 q5, p p (,,,..., ) (,,..., p ) 3
22 k Lookhed Delegtion Model M ( Q,, δ, s, F) : the composite NFA A ( A #...# A ) = How cn we use M deteministiclly? k delegto fo M is n equivlent k-symbol lookhed ( Q δ s F) Σ k ~ DFA,,,,, with δ : Q Q veify k ( ) δ ( ) δ ( ) i i ing: q,... Q Σ : q,... q,, i k
23 k Lookhed Delegtion Model ( Q,, δ, s, F) : the composite NFA ( #...# ) M = A A A How cn we use M deteministiclly? k delegto fo M is n equivlent k-symbol lookhed ( Q δ s F) DFA,,,, Σ k ~, with δ : Q Q ve i k ( ) δ ( ) δ ( ) i i fying: q,... Q Σ : q,... q,, i k
24 k Lookhed Delegtion Model Intepettion: n NFA M k delegto fo M q q... q j... q t δ ( q, ) q... i q j (,... ) q = δ q q t i k ( q,... ) Q : δ ( q,... ) δ ( q, ) Σ i i
25 Exmple: n unmbiguous NFA 3 b ( ( ) + ( ) ) b b 4 5
26 Exmple: delegto b 3 b b, b ( ( ) + ( ) ) b b,, 4 5 This unmbiguous NFA hs delegto.
27 Exmple: n unmbiguous NFA 3 ( + ) 4 5 this unmbigous NFA hs no k-delegto, k >.
28 Exmple: no delegtos 3 ( + ) 4 5 This unmbigous NFA hs no k-delegto, k >.
29 Exmple: n mbiguous NFA... p pk p k p q... qk q k ( + ) k
30 Exmple: k delegto, no (<k) delegto k, k p,,... k k k pk... p k k k,,..., p k... q k, k qk... q k k k,,..., ( + ) k This NFA hs k-delegto but no ( k ) - delegtos. Note: k-delegtion ( k ) + -delegtion
31 Exmple: n mbiguous NFA,, s s s s 3 ( + ) ( ) ( + )
32 Exmple: no delegtos,, s s s s 3 ( + ) ( ) ( + ) This NFA hs no k-delegto, fo ny k >. ide: tke nd k- k k- k+
33 Why Study NFA Delegtion E Sevice Composition given some specifictions nd set of e sevices, implement n ppliction which follows the specifictions. Deteministic simultion of NFA: ltentive to clssicl subset constuction to simulte n NFA by DFA. Line blow up vs. exponentil blow up. A theoeticl metic fo nondeteminism: if n NFA M hs 3 delegto nd M does not hve k delegto fo, sy k <, then M is moe nondeteministic thn M.
34 Lnguge vs. Mchine Popety 'st Question: Is delegtion lnguge popety o mchine popety? (thee exist infinitely mny NFA fo given egul lnguge)
35 Delegtion s Lnguge Popety L - egul lnguge. L is wekly delegble if ( M )( k )( M hs k delegto) NFA fo L k >. L is stongly delegble if ( k )( M )( M hs k delegto) k> NFA fo L
36 Delegtion s Lnguge Popety Theoem. L is stongly deleg. L is wekly deleg. L is finite Consequence. It is moe inteesting to see delegbility s mchine popety.
37 Complexity of Finding k Delegto Poblems: ( ) P k is n intege not pt of the input. ( P ) ( P ) 3 input : n NFA M output : YES if M hs k delegto, NO othewise input : n NFA M nd n intege k output : YES if M hs k delegto, NO othewise input : n NFA M output : YES if M hs delegto, NO othewise
38 Stte Blindness [ ]... k q p kv p... kv q is... -blind if k (, ) δ (, ), : δ (,... ), δ (,... ) p δ q p q v p v F p v F k k stte is k-blind if thee exists... such tht it is... -blind k k
39 Stte Blindness [ ]... k q p kv p... kv q is... -blind if k (, ) δ (, ), : (,... ), (,... ) p δ q p q v δ p v F= φ δ p v F φ k k stte is k-blind if thee exists... such tht it is... -blind k k
40 Stte blindness is computble Recll tht sting w is q blind if it is not possible in stte q to find deteministic choice given w s the look hed. Define B q = { w w is q blind } Theoem: Let M be DFA with n sttes, nd ove n lphbet of size m, nd let q be stte of M. The lnguge B q is egul, nd thee is DFA with t most (4 n + ) m tht ccepts B q.
41 A Chcteiztion fo Unmbiguous NFA Theoem. An unmbiguous NFA hs k-delegto iff none of its sttes e k-blind. Consequently, n unmbiguous NFA hs delegto iff ll its sttes hve finite blindness.
42 Poblem fo unmbiguous NFA s Theoem: Let k be fixed intege. Thee is polynomil time lgoithm tht given n unmbiguous NFA M detemines if M hs k delegto. Poof (sketch) The poblem cn be educed to the poblem of continment poblem fo unmbiguous NFA s. Fom esult of Hunt nd Stens, this poblem is known to be solvble in polynomil time.
43 Delegtion fo Unmbiguous NFA Theoem(). s ( P) ( P ) ( P ) 3 unmbiguous NFA P co-np PSPACE The poof of co NP nd PSPACE uppe bounds fo P nd P3 e simil to tht of Poblem.
44 Abity NFA All 3 poblems e significntly hde fo genel NFA: - delegto fo (tim) unmbiguous NFA must use ll its sttes: locl popeties (blindness) hve globl impct; - continment nd equivlence poblems e decidble in polynomil time fo unmb. NFA.
45 Abity NFA: Fobidden Wods [ ]... k q p kbp... kb q is... -fobidden if one of the following two conditions k is stisfied ecusively (intuitive def.) :. q is... -blind; k ( ). fo evey stte p δ q, thee exists b such tht p is... b -fobidden. k p p
46 Abity NFA: Fobidden Wods [ ]... k q p kbp... kb q is... -fobidden k is stisfied ecusively (intuitive def.) : if one of the following two conditions. q is... - blind; k ( q ). fo evey stte p δ, thee exists b such tht p is... b - fobidden. k p p
47 Abity NFA: Delegtion Chcteiztion Nottion: F is the set of ll fobidden wods fo q. q Theoem. ( δ ) ( ) An NFA M = Q, Σ,, q, F hs k-delegto iff F pef L = φ. q k M Consequently, n NFA hs delegto iff F is finite. q
48 Delegtion fo Unmbiguous NFA Theoem(). s ( P ) ( P ) ( P ) 3 genel NFA PSPACE-complete PSPACE-hd?
49 Wp up NFA delegtion is finite stte model used in web sevice pplictions, tsk scheduling, NFA simultion, mesue of nondeteminism, etc. NFA delegtion is mchine popety nd its computtionl complexity is mchine dependent: ( P) ( P ) ( P ) 3 unmbiguous P co-np PSPACE genel PSPACE-complete PSPACE-hd? (pevious wok: fo k =, P in the genel cse : EXPTIME)
50 Min open poblem: Diection fo futue wok Investigte complexity mttes fo othe fmilies of NFA. Fo exmple, study NFA tht e shuffle poduct of DFA. Is delegtion decidble fo bity NFA? Study the ntue of. F q Othe Questions: The complexity esult fo Poblem (genel cse) ws poven fo 4 lette lphbet. Cn the PSPACE completeness poof be extended to smlle lphbets? Is poblem complete fo co NP fo unmbiguous NFA? Is poblem 3 complete fo PSPACE fo unmbiguous NFA?
51 Refeences Sevice oiented computing: R. Hull nd J. Su. Tools fo Design of Composite Web Sevices. In SIGMOD 4, pp (4) M. Mecell nd G. D. Gicomo. Sevice Composition: Technologies, Methods nd Tools fo Synthesis nd Ochesttion of Composite Sevices nd Pocesses. Tutoil in ICSOC 4. D. Bedi, D. Clvnese, G. D. Gicomo, M. Lenzeini, nd M. Mecell. Automtic Composition of e Sevices tht Expot thei Behviou. In ICSOC 3, LNCS 9, pp , 3. Finite stte models fo e sevices: C. E. Geede, O. H. Ib, B. Rvikum, nd J. Su. On line nd Ad hoc Minimum Cost Delegtion in e Sevice Composition. In IEEE SCC, pp. 3, 5. Z. Dng, O. H. Ib, nd J. Su. Composbility of Infinite Stte Activity Automt. In ISAAC 4, LNCS 334, pp C. E. Geede, R. Hull, O. H. Ib, nd J. Su. Automted Composition of e Sevices: Lookheds. In ISOC 4, pp. 5 6.
52 Design Methodology Exmple p d d 3 es d : downlods nd pocesses files sequentilly P es : downlods files t time nd pocesses them in pllel S - ppliction specifiction: p p downlod nd pocess, hving no moe thn files in the system t ny time d P d 3
53 Design Methodology Step constuct es # es : p d [,] P [,] d [, ] p d [, ] d [,3] P d [, 3] d p it epesents the shuffle behvio of es nd es
54 Design Methodology Step constuct S es # es : p [,,] d [,,] p [ 3,, ] d [,, ] d d P [ 3,,3] it epesents the nondeteministic behvio of the ppliction ( S)
55 Design Methodology Step 3 find delegto : pd, p es dp dd pd dp ddpdpd p es P, Pd dp it epesents the design of S
Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s:
Chpte 7 Kleene s Theoem 7.1 Kleene s Theoem The following theoem is the most impotnt nd fundmentl esult in the theoy of FA s: Theoem 6 Any lnguge tht cn e defined y eithe egul expession, o finite utomt,
More informationLanguage Processors F29LP2, Lecture 5
Lnguge Pocessos F29LP2, Lectue 5 Jmie Gy Feuy 2, 2014 1 / 1 Nondeteministic Finite Automt (NFA) NFA genelise deteministic finite utomt (DFA). They llow sevel (0, 1, o moe thn 1) outgoing tnsitions with
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 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 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 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 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 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 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 information2-Way Finite Automata Radboud University, Nijmegen. Writer: Serena Rietbergen, s Supervisor: Herman Geuvers
2-Wy Finite Automt Rdoud Univesity, Nijmegen Wite: Seen Rietegen, s4182804 Supeviso: Hemn Geuves Acdemic Ye 2017-2018 Contents 1 Intoduction 3 2 One wy utomt, deteministic nd non-deteministic 5 3 Ovehed
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 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 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 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 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 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 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 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 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 informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.6.: Push Down Automt Remrk: This mteril is no longer tught nd not directly exm relevnt Anton Setzer (Bsed
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 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 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 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 informationCS5371 Theory of Computation. Lecture 20: Complexity V (Polynomial-Time Reducibility)
CS5371 Theory of Computtion Lecture 20: Complexity V (Polynomil-Time Reducibility) Objectives Polynomil Time Reducibility Prove Cook-Levin Theorem Polynomil Time Reducibility Previously, we lernt tht if
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 information( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x
SIO 22B, Rudnick dpted fom Dvis III. Single vile sttistics The next few lectues e intended s eview of fundmentl sttistics. The gol is to hve us ll speking the sme lnguge s we move to moe dvnced topics.
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 informationDiscrete Mathematics and Logic II. Automata
Discete Mthemtics nd Logic II. Automt SFWR ENG 2FA3 Ryszd Jnicki Winte 2014 Acknowledgments: Mteil sed on Automt nd Computility y Dexte C. Kozen (Chpte 3). Ryszd Jnicki Discete Mthemtics nd Logic II. Automt
More informationCS 267: Automated Verification. Lecture 8: Automata Theoretic Model Checking. Instructor: Tevfik Bultan
CS 267: Automted Verifiction Lecture 8: Automt Theoretic Model Checking Instructor: Tevfik Bultn LTL Properties Büchi utomt [Vrdi nd Wolper LICS 86] Büchi utomt: Finite stte utomt tht ccept infinite strings
More informationMath 4318 : Real Analysis II Mid-Term Exam 1 14 February 2013
Mth 4318 : Rel Anlysis II Mid-Tem Exm 1 14 Febuy 2013 Nme: Definitions: Tue/Flse: Poofs: 1. 2. 3. 4. 5. 6. Totl: Definitions nd Sttements of Theoems 1. (2 points) Fo function f(x) defined on (, b) nd fo
More informationGood-for-Games Automata versus Deterministic Automata.
Good-for-Gmes Automt versus Deterministic Automt. Denis Kuperberg 1,2 Mich l Skrzypczk 1 1 University of Wrsw 2 IRIT/ONERA (Toulouse) Séminire MoVe 12/02/2015 LIF, Luminy Introduction Deterministic utomt
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationCSCI FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not
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 informationFI 2201 Electromagnetism
FI 1 Electomgnetism Alexnde A. Isknd, Ph.D. Physics of Mgnetism nd Photonics Resech Goup Electosttics ELECTRIC PTENTIALS 1 Recll tht we e inteested to clculte the electic field of some chge distiution.
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 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 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 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 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 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 informationHomework 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 informationIntroduction to ω-autamata
Fridy 25 th Jnury, 2013 Outline From finite word utomt ω-regulr lnguge ω-utomt Nondeterministic Models Deterministic Models Two Lower Bounds Conclusion Discussion Synthesis Preliminry From finite word
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 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 informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
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 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 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 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 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 informationRecursively Enumerable and Recursive. Languages
Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings
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 informationLecture 6 Regular Grammars
Lecture 6 Regulr Grmmrs COT 4420 Theory of Computtion Section 3.3 Grmmr A grmmr G is defined s qudruple G = (V, T, S, P) V is finite set of vribles T is finite set of terminl symbols S V is specil vrible
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 informationCMSC 330: Organization of Programming Languages. DFAs, and NFAs, and Regexps (Oh my!)
CMSC 330: Orgniztion of Progrmming Lnguges DFAs, nd NFAs, nd Regexps (Oh my!) CMSC330 Spring 2018 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All
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 informationOn Determinisation of History-Deterministic Automata.
On Deterministion of History-Deterministic Automt. Denis Kupererg Mich l Skrzypczk University of Wrsw YR-ICALP 2014 Copenhgen Introduction Deterministic utomt re centrl tool in utomt theory: Polynomil
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 informationData Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2.
Element Uniqueness Poblem Dt Stuctues Let x,..., xn < m Detemine whethe thee exist i j such tht x i =x j Sot Algoithm Bucket Sot Dn Shpi Hsh Tbles fo (i=;i
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 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 informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probbilistic Model Checking Michelms Term 2011 Dr. Dve Prker Deprtment of Computer Science University of Oxford Long-run properties Lst lecture: regulr sfety properties e.g. messge filure never occurs
More informationWeek 8. Topic 2 Properties of Logarithms
Week 8 Topic 2 Popeties of Logithms 1 Week 8 Topic 2 Popeties of Logithms Intoduction Since the esult of ithm is n eponent, we hve mny popeties of ithms tht e elted to the popeties of eponents. They e
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 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 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 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 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 informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
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 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 informationPreviously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system
436-459 Advnced contol nd utomtion Extensions to bckstepping contolle designs Tcking Obseves (nonline dmping) Peviously Lst lectue we looked t designing nonline contolles using the bckstepping technique
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 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 informationFormal Methods in Software Engineering
Forml Methods in Softwre Engineering Lecture 09 orgniztionl issues Prof. Dr. Joel Greenyer Decemer 9, 2014 Written Exm The written exm will tke plce on Mrch 4 th, 2015 The exm will tke 60 minutes nd strt
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 informationCS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7
CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop
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 informationɛ-closure, Kleene s Theorem,
DEGefW5wiGH2XgYMEzUKjEmtCDUsRQ4d 1 A nice pper relevnt to this course is titled The Glory of the Pst 2 NICTA Resercher, Adjunct t the Austrlin Ntionl University nd Griffith University ɛ-closure, Kleene
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 informationOptimization. x = 22 corresponds to local maximum by second derivative test
Optimiztion Lectue 17 discussed the exteme vlues of functions. This lectue will pply the lesson fom Lectue 17 to wod poblems. In this section, it is impotnt to emembe we e in Clculus I nd e deling one-vible
More informationLearning Moore Machines from Input-Output Traces
Lerning Moore Mchines from Input-Output Trces Georgios Gintmidis 1 nd Stvros Tripkis 1,2 1 Alto University, Finlnd 2 UC Berkeley, USA Motivtion: lerning models from blck boxes Inputs? Lerner Forml Model
More informationITI Introduction to Computing II
ITI 1121. Intoduction to Computing II Mcel Tucotte School of Electicl Engineeing nd Compute Science Abstct dt type: Stck Stck-bsed lgoithms Vesion of Febuy 2, 2013 Abstct These lectue notes e ment to be
More informationPrefix-Free Subsets of Regular Languages and Descriptional Complexity
Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek Jurj Šeej DCFS 2015 Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek, Jurj Šeej 1/22 Outline Mximl
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY. FLAC (15-453) - Spring L. Blum
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY THE PUMPING LEMMA FOR REGULAR LANGUAGES nd REGULAR EXPRESSIONS TUESDAY Jn 21 WHICH OF THESE ARE REGULAR? B = {0 n 1 n n 0} C = { w w hs equl numer of
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 informationLecture 18: Graph Isomorphisms
INFR11102: Computational Complexity 22/11/2018 Lectue: Heng Guo Lectue 18: Gaph Isomophisms 1 An Athu-Melin potocol fo GNI Last time we gave a simple inteactive potocol fo GNI with pivate coins. We will
More informationSynchronizing Automata with Random Inputs
Synchronizing Automt with Rndom Inputs Vldimir Gusev Url Federl University, Ekterinurg, Russi 9 August, 14 Vldimir Gusev (UrFU) Synchronizing Automt with Rndom Input 9 August, 14 1 / 13 Introduction Synchronizing
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 informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More information5.1 Definitions and Examples 5.2 Deterministic Pushdown Automata
CSC4510 AUTOMATA 5.1 Definitions nd Exmples 5.2 Deterministic Pushdown Automt Definitions nd Exmples A lnguge cn be generted by CFG if nd only if it cn be ccepted by pushdown utomton. A pushdown utomton
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 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 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 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 informationSolution to HW 3, Ma 1a Fall 2016
Solution to HW 3, Ma a Fall 206 Section 2. Execise 2: Let C be a subset of the eal numbes consisting of those eal numbes x having the popety that evey digit in the decimal expansion of x is, 3, 5, o 7.
More information