3 Regular expressions

Save this PDF as:

Size: px
Start display at page:

Download "3 Regular expressions"

Transcription

1 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 introduce regulr expressions s n elegnt nd concise wy to descrie lnguges. We shll see tht the lnguges definle y regulr expressions re precisely the sme s those ccepted y deterministic or nondeterministic finite utomt. These lnguges re clled regulr lnguges or (ccording to the Chomsky hierrchy) Type 3 lnguges. As lredy mentioned in the introduction regulr expressions re used to define ptterns in progrms such s grep. grep gets s n rgument regulr expression nd then filters out ll those lines from file which mtch the regulr expression, where mtching mens tht the line contins sustring which is in the lnguge ssigned to the regulr expression. It is interesting to note tht even in the cse when we serch for specific word (this is specil cse of regulr expresion) progrms like grep re more efficient thn nive implementtion of word serch. To find out more out grep hve look t the UNIX mnul pge nd ply round with grep. Note tht the syntx grep uses is slightly different from the one we use here. grep lso use some convenient shorthnds which re not relevnt for theoreticl nlysis of regulr expressions ecuse they do not extend the clss of lnguges. 3.1 Wht re regulr expressions? We ssume s given n lphet Σ (e.g. Σ = {,, c,..., z}) nd define the syntx of regulr expressions (over Σ) 1. is regulr expression. 2. ɛ is regulr expression. 3. For ech x Σ, x is regulr expression. E.g. in the exmple ll smll letters re regulr expression. We use oldfce to emphsize the difference etween the symol nd the regulr expression. 4. If E nd F re regulr expressions then E + F is regulr expression. 5. If E nd F re regulr expressions then EF (i.e. just one fter the other) is regulr expression. 6. If E is regulr expression then E is regulr expression. 7. If E is regulr expression then (E) is regulr expression. These re ll regulr expressions. Here re some exmples for regulr expressions: ɛ hllo hllo + hello h( + e)llo (ɛ + )() (ɛ + ) As in rithmetic they re some conventions how to red regulr expressions: inds stronger then sequence nd +. E.g. we red s ( ). We hve to use prentheses to enforce the other reding (). Sequencing inds stronger thn +. E.g. we red + cd s () + (c). To enforce nother reding we hve to use prentheses s in ( + c)d. 3.2 The mening of regulr expressions We now know wht regulr expressions re ut wht do they men? For this purpose, we shll first define n opertion on lnguges clled the Kleene str. Given lnguge L Σ we define L = {w 0w 1... w n 1 n N i < n.w i L} Intuitively, L contins ll the words which cn e formed y conctenting n ritrry numer of words in L. This includes the empty word since the numer my e 0. As n exmple consider L = {, } {, } : L = {ɛ,,,,,,,... } You should notice tht we use the sme symol s in Σ ut there is sutle difference: Σ is set of symols ut L Σ is set of words. Alterntively (nd more strctly) one my descrie L s the lest lnguge (wrt ) which contins L nd the empty word nd is closed under conctention: w L v L = wv L We now define the semntics of regulr expressions: To ech regulr expression E over Σ we ssign lnguge L(E) Σ. We do this y induction over the definition of the syntx: 1. L( ) = 2. L(ɛ) = {ɛ} 3. L(x) = {x} where x Σ. 4. L(E + F ) = L(E) L(F ) 5. L(EF ) = {wv w L(E) v L(F )} 6. L(E ) = L(E) 7. L((E)) = L(E) 14 13

2 Sutle points: in 1. the symol my e used s regulr expression (s in L( )) or the empty set ( = {}). Similrily, ɛ in 2. my e regulr expression or word, in 6. my e used to construct regulr expressions or it is n opertion on lnguges. Which lterntive we men ecomes only cler from the context, there is no generlly greed mthemticl nottion 1 to mke this difference explicit. Let us now clculte wht the exmples of regulr expressions from the previous section men, i.e. wht re the lnguges they define: ɛ hllo By 2. L(ɛ) = {ɛ} Let s just look t L(h). We know from 3: Hence y 5: L(h) = {h} L() = {} L(h) = {wv w {h} v {}} = {h} Continuing the sme resoning we otin: hllo + hello h( + e)llo L(hllo) = {hllo} From the previous point we know tht: Hence y using 4 we get: Using 3 nd 4 we know Hence using 5 we otin: L(hllo) = {hllo} L(hello) = {hello} L(hllo + hello) = {hllo} {hello}} = {hllo, hello} L( + e) = {, e} L(h( + e)llo) = {uvw u L(h) v L( + e) w L(llo)} = {uvw u {h} v {, e} w {(llo}} = {hllo, hello} 1 This is different in progrmming, e.g. in JAVA we use "... " to signl tht we men things literlly. Let us introduce the following nottion: Now using 6 we know tht w i = ww... w }{{} i times L( ) = {w 0w 1... w n 1 n N i < n.w i L()} = {w 0w 1... w n 1 n N i < n.w i {}} = { n n N} nd hence using 5 we conclude L( ) = {uv u L( ) v L( )} = {uv u { n n N} v { m m N}} = { n m m, n N} I.e. L( ) is the set of ll words which strt with (possily empty) sequence of s followed y (possily empty) sequence of s. (ɛ + )() (ɛ + ) Let s nlyze the prts: Hence, we hve L(ɛ + ) = {ɛ, } L(() ) = { i i N} L(ɛ + ) = {ɛ, } L((ɛ + )() (ɛ + )) = {u() i v u {ɛ, } i N v {ɛ, } In english: L((ɛ + )() (ɛ + )) is the set of (possily empty) sequences of interchnging s nd s. 3.3 Trnslting regulr expressions to NFAs Theorem 3.1 For ech regulr expression E we cn construct NFA N(E) s.t. L(N(E)) = L(E), i.e. the utomton ccepts the lnguge descried y the regulr expression. Proof: We do this gin y induction on the syntx of regulr expressions: 1. N( ): 16 15

3 x N(0) N(x) which will reject everything (it hs got no finl sttes) nd hence L(N( )) = = L( ) 2. N(ɛ): This utomton only ccepts the word x, hence: L(N(x)) = {x} = L(x) 4. N(E + F ): We merge the digrms for N(E) nd N(F ) into one: N(E) N(F) N( ε) I.e. given N(E+F) N(E) = (Q E, Σ, δ E, S E, F E) N(F ) = (Q F, Σ, δ F, S F, F F ) This utomton ccepts the empty word ut rejects everything else, hence: Now we use the disjoint union opertion on sets (see the MCS lecture L(N(ɛ)) = {ɛ} = L(ɛ) 3. N(x): 18 17

4 notes [Alt01], section 4.1) Q E+F = Q E + Q F δ E+F ((0, q), x) = {(0, q ) q δ E (q, x)} δ E+F ((1, q)), x = {(1, q ) q δ F (q, x)} S E+F = S E + S F F E+F = F E + F F N(E + F ) = (Q E+F, Σ, δ E+F, S E+F, F E+F ) The disjoint union just signls tht we re not going to identify sttes, even if they ccidently hppen to hve the sme nme. Just thinking of the gme with mrkers you should e le to convince yourself tht L(N(E + F )) = L(N(E)) L(N(F )) Moreover to show tht we re llowed to ssume tht L(N(E + F )) = L(E + F ) L(N(E)) = L(E) L(N(F )) = L(F ) tht s wht is ment y induction over the syntx of regulr expressions. Now putting everything together: 5. N(EF ): L(N(E + F )) = L(N(E)) L(N(F )) = L(E) L(F ) = L(E + F ) We wnt to put the two utomt N(E) nd N(F ) in series. We do this y connecting the finl sttes of N(E) with the initil sttes of N(F ) in wy explined elow. In this digrm I only depicted one initil nd one finl stte of ech of the utomt lthough they my e severl of them. Here is how we construct N(EF ) from N(E) nd N(F ): N(E) = (Q E, Σ, δ E, S E, F E) N(F ) = (Q F, Σ, δ F, S F, F F ) The sttes of N(EF ) re the disjoint union of the sttes of N(E) nd N(F ): Q EF = Q E + Q F The trnsition function of N(EF ) contins ll the trnsitions of N(E) nd N(F ) (s for N(E + F )) nd for ech stte q of N(E) which hs trnsition to finl stte of N(E) we dd trnsition with the sme lel to ll the initil sttes of N(F ). δ EF ((0, q), x) = {(0, q ) q δ E(q, x)} {(1, q ) q.q δ E(q, x) q S E} δ EF ((1, q)) = {(1, q ) q δ F (q))} The initil sttes of N(EF ) re the initil sttes of N(E), nd the initil sttes of N(F ) if there is n initil stte of N(E) which is lso finl stte. S EF = {(0, q) q S E} {(1, q) q S F S E F E } The finl sttes of N(EF ) re the finl sttes of N(F ). We now set F EF = {(1, q) q F F } N(EF ) = (Q EF, Σ, δ EF, S EF, Z EF ) I hope tht you re le to convince yourself tht nd hence we cn reson L(N(EF )) = {uv u L(N(E)) v L(N(F )) N(E) N(F) L(N(EF )) = {uv u L(N(E)) v L(N(F )) = {uv u L(E) v L(F ) 6. N(E ): = L(EF ) We construct N(E ) from N(E) y merging initil nd finl sttes of N(E) in wy similr to the previous construction nd we dd new stte which is initil nd finl. N(EF) 20 19

5 * since we cn run through the utomton n ritrry numer of times. The new stte llows us lso to ccept the empty sequence. Hence: L(N(E )) = {w 0w 1... w n 1 n N i < n.w i L(N(E))} = L(N(E)) = L(E) = L(E ) N(E) N(E*) 7. N((E)) = N(E) I.e. using rckets does not chnge nything. As n exmple we construct N( ). First we construct N(): Given we construct N(E ). N(E) = (Q E, Σ, δ E, S E, F E ) We dd one extr stte : Q E = Q E + { } N E inherits ll trnsitions form N E nd for ech stte which hs n rrow to the finl stte lelled x we lso dd n rrow to ll the initil sttes lelled x. N() Now we hve to pply the -construction nd we otin: δ E ((0, q), x) ={(0, q ) q δ E (q, x)} {(0, q ) δ E (q, x) F E q S E } The initil sttes of N(E ) re the initil sttes of N(E) nd : S E = {(0, q) q S E } {(1, )} The finl sttes of N E re the finl sttes of N E nd : F E = {(0, q) q F E } {(1, )} We define We clim tht N(E ) = (Q E, Σ, δ E, S E, F E ) N(*) L(N(E )) = {w 0 w 1... w n 1 n N i < n.w i L(N(E))} N( ) is just the sme nd we get 22 21

6 N(*) N(*) nd now we hve to serilize the two utomt nd we get: 1. L is given y regulr expression. 2. L is the lnguge ccepted y n NFA. 3. L is the lnguge cceped y DFA. Proof: We hve tht 1. = 2 y theorem 3.1. We know tht 2. = 3. y2.2 nd 3. = 1. y 3.2. As indicted in the introduction: the lnguges which re chrcterized y ny of the three equivlent conditions re clled regulr lnguges or type-3- lnguges. N(**) Now, you my oserve tht this utomton, though correct, is unnecessry complicted, since we could hve just used However, we shll not e concerned with minimlity t the moment. 3.4 Summing up... From the previous section we know tht lnguge given y regulr expression is lso recognized y NFA. Wht out the other wy: Cn lnguge recognized y finite utomton (DFA or NFA) lso e descried y regulr expression? The nswer is yes: Theorem 3.2 (Theorem 3.4, pge 91) Given DFA A there is regulr expression R(A) which recognizes the sme lnguge L(A) = L(R(A)). We omit the proof (which cn e found in the [HMU01] on pp.91-93). However, we conclude: Corollry 3.3 Given lnguge L Σ the following is equivlent: 24 23

1 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 information

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 information

Homework 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 information

CS 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 information

Regular 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 information

Chapter 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 information

Non-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 information

Automata Theory 101. Introduction. Outline. Introduction Finite Automata Regular Expressions ω-automata. Ralf Huuck.

Outline Automt Theory 101 Rlf Huuck Introduction Finite Automt Regulr Expressions ω-automt Session 1 2006 Rlf Huuck 1 Session 1 2006 Rlf Huuck 2 Acknowledgement Some slides re sed on Wolfgng Thoms excellent

More information

Types 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 information

1 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 information

CS 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 information

Lexical Analysis Finite Automate

Lexicl Anlysis Finite Automte CMPSC 470 Lecture 04 Topics: Deterministic Finite Automt (DFA) Nondeterministic Finite Automt (NFA) Regulr Expression NFA DFA A. Finite Automt (FA) FA re grph, like trnsition

More information

12.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 information

1.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 information

NON-DETERMINISTIC FSA

Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Speech Recognition Lecture 2: Finite Automata and Finite-State Transducers

Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Eugene Weinstein Google, NYU Cournt Institute eugenew@cs.nyu.edu Slide Credit: Mehryr Mohri Preliminries Finite lphet, empty string.

More information

a,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 information

input 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 information

Context-Free Grammars and Languages

Context-Free Grmmrs nd Lnguges (Bsed on Hopcroft, Motwni nd Ullmn (2007) & Cohen (1997)) Introduction Consider n exmple sentence: A smll ct ets the fish English grmmr hs rules for constructing sentences;

More information

State 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 information

Nondeterminism. 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 information

CS 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

Homework Solution - Set 5 Due: Friday 10/03/08

CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

More information

CS375: 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 information

Chapter 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 information

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

Lecture 9: LTL and Büchi Automata

Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled

More information

Formal Languages and Automata Theory. D. Goswami and K. V. Krishna

Forml Lnguges nd Automt Theory D. Goswmi nd K. V. Krishn Novemer 5, 2010 Contents 1 Mthemticl Preliminries 3 2 Forml Lnguges 4 2.1 Strings............................... 5 2.2 Lnguges.............................

More information

8 Automata and formal languages. 8.1 Formal languages

8 Automt nd forml lnguges This exposition ws developed y Clemens Gröpl nd Knut Reinert. It is sed on the following references, ll of which re recommended reding: 1. Uwe Schöning: Theoretische Informtik

More information

Chapter 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 information

Grammar. 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 information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Normal Forms for Context-free Grammars

Norml Forms for Context-free Grmmrs 1 Linz 6th, Section 6.2 wo Importnt Norml Forms, pges 171--178 2 Chomsky Norml Form All productions hve form: A BC nd A vrile vrile terminl 3 Exmples: S AS S AS S S

More information

Overview HC9. Parsing: Top-Down & LL(1) Context-Free Grammars (1) Introduction. CFGs (3) Context-Free Grammars (2) Vertalerbouw HC 9: Ch.

Overview H9 Vertlerouw H 9: Prsing: op-down & LL(1) do 3 mei 2001 56 heo Ruys h. 8 - Prsing 8.1 ontext-free Grmmrs 8.2 op-down Prsing 8.3 LL(1) Grmmrs See lso [ho, Sethi & Ullmn 1986] for more thorough

More information

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

More information

Where did dynamic programming come from?

Where did dynmic progrmming come from? String lgorithms Dvid Kuchk cs302 Spring 2012 Richrd ellmn On the irth of Dynmic Progrmming Sturt Dreyfus http://www.eng.tu.c.il/~mi/cd/ or50/1526-5463-2002-50-01-0048.pdf

More information

The University of Nottingham

The University of Nottinghm SCHOOL OF COMPUTR SCINC AND INFORMATION TCHNOLOGY A LVL 1 MODUL, SPRING SMSTR 2004-2005 MACHINS AND THIR LANGUAGS Time llowed TWO hours Cndidtes must NOT strt writing their

More information

Nondeterministic Finite Automata

Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

Complementing Büchi Automata with a Subset-tuple Construction

DEPARTEMENT D INFORMATIQUE DEPARTEMENT FÜR INFORMATIK Bd de Pérolles 90 CH-1700 Friourg www.unifr.ch/informtics WORKING PAPER Complementing Büchi Automt with Suset-tuple Construction J. Allred & U. Ultes-Nitsche

More information

5.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 information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Lecture 2 : Propositions DRAFT

CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte

More information

Software Engineering using Formal Methods

Softwre Engineering using Forml Methods Propositionl nd (Liner) Temporl Logic Wolfgng Ahrendt 13th Septemer 2016 SEFM: Liner Temporl Logic /GU 160913 1 / 60 Recpitultion: FormlistionFormlistion: Syntx,

More information

C Dutch System Version as agreed by the 83rd FIDE Congress in Istanbul 2012

04.3.1. Dutch System Version s greed y the 83rd FIDE Congress in Istnul 2012 A Introductory Remrks nd Definitions A.1 Initil rnking list A.2 Order See 04.2.B (Generl Hndling Rules - Initil order) For pirings

More information

CSCI 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 information

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding

More information

How Deterministic are Good-For-Games Automata?

How Deterministic re Good-For-Gmes Automt? Udi Boker 1, Orn Kupfermn 2, nd Mich l Skrzypczk 3 1 Interdisciplinry Center, Herzliy, Isrel 2 The Herew University, Isrel 3 University of Wrsw, Polnd Astrct

More information

Linear Systems with Constant Coefficients

Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

On 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 information

Section: 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 information

Recursively 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 information

Nondeterministic Biautomata and Their Descriptional Complexity

Nondeterministic Biutomt nd Their Descriptionl Complexity Mrkus Holzer nd Sestin Jkoi Institut für Informtik Justus-Lieig-Universität Arndtstr. 2, 35392 Gießen, Germny 23. Theorietg Automten und Formle

More information

CS 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 information

Lecture 7 notes Nodal Analysis

Lecture 7 notes Nodl Anlysis Generl Network Anlysis In mny cses you hve multiple unknowns in circuit, sy the voltges cross multiple resistors. Network nlysis is systemtic wy to generte multiple equtions

More information

Learning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus

Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,

More information

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors

More information

MTH 505: Number Theory Spring 2017

MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of \$ nd \$ s two denomintions of coins nd \$c

More information

7 Automata and formal languages. 7.1 Formal languages

7 Automt nd forml lnguges This exposition ws developed by Clemens Gröpl nd Knut Reinert. It is bsed on the following references, ll of which re recommended reding: 1. Uwe Schöning: Theoretische Informtik

More information

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

More information

Solutions Problem Set 2. Problem (a) Let M denote the DFA constructed by swapping the accept and non-accepting state in M.

Solution Prolem Set 2 Prolem.4 () Let M denote the DFA contructed y wpping the ccept nd non-ccepting tte in M. For ny tring w B, w will e ccepted y M, tht i, fter conuming the tring w, M will e in n ccepting

More information

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that

Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de

More information

How to simulate Turing machines by invertible one-dimensional cellular automata

How to simulte Turing mchines by invertible one-dimensionl cellulr utomt Jen-Christophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

Domino Recognizability of Triangular Picture Languages

Interntionl Journl of Computer Applictions (0975 8887) Volume 57 No.5 Novemer 0 Domino Recognizility of ringulr icture Lnguges V. Devi Rjselvi Reserch Scholr Sthym University Chenni 600 9. Klyni Hed of

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Homework Assignment 3 Solution Set

Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

On NFA reductions. N6A 5B7, London, Ontario, CANADA ilie 2 Department of Computer Science, University of Chile

On NFA reductions Lucin Ilie 1,, Gonzlo Nvrro 2, nd Sheng Yu 1, 1 Deprtment of Computer Science, University of Western Ontrio N6A 5B7, London, Ontrio, CANADA ilie syu@csd.uwo.c 2 Deprtment of Computer

More information

8 Laplace s Method and Local Limit Theorems

8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + \$

More information

The solutions of the single electron Hamiltonian were shown to be Bloch wave of the form: ( ) ( ) ikr

Lecture #1 Progrm 1. Bloch solutions. Reciprocl spce 3. Alternte derivtion of Bloch s theorem 4. Trnsforming the serch for egenfunctions nd eigenvlues from solving PDE to finding the e-vectors nd e-vlues

More information

Bernd Finkbeiner Date: October 25, Automata, Games, and Verification: Lecture 2

Bernd Finkeiner Dte: Octoer 25, 2012 Automt, Gmes, nd Verifiction: Lecture 2 2 Büchi Automt Definition1 AnondeterministicBüchiutomtonAoverlphetΣistuple(S,I,T,F): S : finitesetof sttes I S:susetof initilsttes

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

State Complexity of Union and Intersection of Binary Suffix-Free Languages

Stte Complexity of Union nd Intersetion of Binry Suffix-Free Lnguges Glin Jirásková nd Pvol Olejár Slovk Ademy of Sienes nd Šfárik University, Košie 0000 1111 0000 1111 Glin Jirásková nd Pvol Olejár Binry

More information

Good-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 information

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-order Pushdown Automata

The Cucl Hierrchy of Infinite Grphs in Terms of Logic nd Higher-order Pushdown Automt Arnud Cryol 1 nd Stefn Wöhrle 2 1 IRISA Rennes, Frnce rnud.cryol@iris.fr 2 Lehrstuhl für Informtik 7 RWTH Achen, Germny

More information

Lecture 3. Limits of Functions and Continuity

Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live

More information

EE273 Lecture 15 Asynchronous Design November 16, Today s Assignment

EE273 Lecture 15 Asynchronous Design Novemer 16, 199 Willim J. Dlly Computer Systems Lortory Stnford University illd@csl.stnford.edu 1 Tody s Assignment Term Project see project updte hndout on we checkpoint

More information

On the Relative Succinctness of Nondeterministic Büchi and co-büchi Word Automata

On the Reltive Succinctness of Nondeterministic Büchi nd co-büchi Word Automt Benjmin Aminof, Orn Kupfermn, nd Omer Lev Herew University, School of Engineering nd Computer Science, Jeruslem 91904, Isrel

More information

Prefix-Free Regular-Expression Matching

Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings

More information

CDM Memoryless Machines

CDM Memoryless Mchines Zero Spce Klus Sutner Crnegie Mellon Universlity 2 Finite Stte Mchines Fll 27 3 DFA Decision Problems Where Are We? 3 Turing Mchines 4 We hve description of bstrct computbility in

More information

MATH STUDENT BOOK. 10th Grade Unit 5

MATH STUDENT BOOK 10th Grde Unit 5 Unit 5 Similr Polygons MATH 1005 Similr Polygons INTRODUCTION 3 1. PRINCIPLES OF ALGEBRA 5 RATIOS AND PROPORTIONS 5 PROPERTIES OF PROPORTIONS 11 SELF TEST 1 16 2. SIMILARITY

More information

Design and Analysis of Distributed Interacting Systems

Design nd Anlysis of Distriuted Intercting Systems Lecture 6 LTL Model Checking Prof. Dr. Joel Greenyer My 16, 2013 Some Book References (1) C. Bier, J.-P. Ktoen: Principles of Model Checking. The MIT

More information

Math 8 Winter 2015 Applications of Integration

Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

Introduction to Electrical & Electronic Engineering ENGG1203

Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll

More information

What else can you do?

Wht else cn you do? ngle sums The size of specil ngle types lernt erlier cn e used to find unknown ngles. tht form stright line dd to 180c. lculte the size of + M, if L is stright line M + L = 180c( stright

More information

New Expansion and Infinite Series

Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

Arithmetic & Algebra. NCTM National Conference, 2017

NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible

More information

The Trapezoidal Rule

_.qd // : PM Pge 9 SECTION. Numericl Integrtion 9 f Section. The re of the region cn e pproimted using four trpezoids. Figure. = f( ) f( ) n The re of the first trpezoid is f f n. Figure. = Numericl Integrtion

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

Separating Regular Languages with First-Order Logic

Seprting Regulr Lnguges with First-Order Logic Thoms Plce Mrc Zeitoun LBRI, Bordeux University, Frnce firstnme.lstnme@lri.fr Astrct Given two lnguges, seprtor is third lnguge tht contins the first one

More information

General Algorithms for Testing the Ambiguity of Finite Automata

Generl Algorithms for Testing the Amiguity of Finite Automt Cyril Alluzen 1,, Mehryr Mohri 2,1, nd Ashish Rstogi 1, 1 Google Reserch, 76 Ninth Avenue, New York, NY 10011. 2 Cournt Institute of Mthemticl

More information

Quadratic reciprocity

Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition

More information

Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.

Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:

More information

Automata 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 information

Convex Sets and Functions

B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information