Relating logic to formal languages
|
|
- Griffin Marshall
- 5 years ago
- Views:
Transcription
1 Relting logic to forml lnguges Kml Lody The Institute of Mthemticl Sciences, Chenni October 2018 Reding 1. Howrd Strubing: Forml lnguges, finite utomt nd circuit complexity, birkhäuser. 2. Wolfgng Thoms: Lnguges, utomt nd logic, in Hndbook of forml lnguge theory III, springer. 3. Pscl Tesson nd Denis Thérien: Logic meets lgebr: the cse of regulr lnguges, lmcs.
2 Finite utomt (McCulloch nd Pitts 1943) Fix finite lphbet A M = (Q, I, F, δ) Finite set of sttes Q Initil sttes I Q Finl sttes F Q Nondeterministic trnsition reltion δ() Q Q, A M ccepts word in A The set of words ccepted is its lnguge b b,b X Y b Z b
3 Algebr (Myhill 1957) Binry reltions (Q Q) form finite monoid (M, ) under composition, generted by the A-lbelled trnsitions using δ(w) δ(x) = δ(wx) Morphism δ : A (Q Q) from A (the free monoid on A) to finite monoid M ccepts word w when δ(w) (I F) (lnguge is inverse imge of finite subset of the finite monoid) Congruence A A w x δ(w) = δ(x) b b A =, b b = 0,b X Y b Z b = 1, b b = 1 (symmetric group S 3 )
4 The utomt-lgebr connection (Myhill-Nerode 1950s) Theorem (Myhill 1957, Nerode 1958, Rbin-Scott 1959) Nondeterministic finite utomt, finite monoids nd deterministic finite utomt re equivlent. 1. Given finite utomton (possibly nondeterministic), the lnguge ccepted by it is n inverse imge of subset of finite monoid (those reltions which tke n initil stte to finl stte), clled its trnsition monoid 2. Given finite monoid M with distinguished set of elements D, (M, 1, {_ A}, D) is deterministic finite utomton (trnsition function insted of reltion) For lnguge, the syntctic monoid is the trnsition monoid of the miniml deterministic finite utomton for tht lnguge
5 Counter-free utomt (McNughton-Ppert 1971) Given finite utomton, the nonempty word w A + is counter if δ(w) induces nontrivil permuttion on Q The word is counter in the bottom utomton on the sttes X, Y, Z, the word b is counter on X, Y An utomton without ny counter is counter-free, for exmple, the top utomton b b A =, b b = 0,b X Y b Z b = 1, b b = 1 (symmetric group S 3 ) The trnsition monoid of counter-free utomton does not contin ny nontrivil subgroup.
6 Prtilly ordered utomt (Meyer-Thompson 1969) In prtilly ordered utomton, the sttes (Q, ) re prtilly ordered A trnsition from stte q cn only go to sttes r such tht q r Hence the only cycles llowed re self-loops where q = r, flling trnsitions where q > r cnnot climb bck (Schwentick-Thérien-Vollmer 2002) A prtilly ordered two-wy deterministic utomton cn ccept more lnguges (e.g. checking the k th lst letter of the word) Prtilly ordered two-wy utomt re counter-free The trnsition monoid of prtilly ordered two-wy deterministic utomton is in DA, defined s: if there is n idempotent element in D-clss, then the entire D-clss is idempotents (this seprtes the self-loops from the flling trnsitions)
7 Logic on words (Büchi 1960) FO ::= (x) x = y x < y Suc(x, y) φ φ ψ xφ, x, y Vr 1 Formuls re interpreted over words with pointers indicting the positions of vribles bbb = Suc(x, y) b(x) b(y) bbb = x < y b(x) b(y) bbb = Suc(x, y) b(x) b(y) Pointer functions like s = [x 5, y 6] bove re clled ssignments nd written w, s = φ in logic textbooks Formlly one cn use pointers lphbet A (V 1 ) where ech vrible is constrined to occur exctly once in the word model. For the first formul bove: ( ) ( ) b ( ) ( ) ( b ) ( ) b {x} {y} = Suc(x, y) b(x) b(y)
8 Sentences FO ::= (x) x = y x < y Suc(x, y) φ φ ψ b b xφ, x, y Vr 1 A sentence is formul with no free vribles, ll vribles re bound to quntifiers The lnguge {w w = x y(suc(x, y) b(x) b(y))} of words where the sentence holds is tht ccepted by the top utomton; the sentence defines the lnguge A bba Sentence x y(suc(x, y) b(x) b(y)) defines A bba
9 Sentences define lnguges Let mx(x) = ysuc(x, y) be n bbrevition, similrly define min(x), etc. x[(x) y(suc(x, y) b(y)) (b(x) mx(x) y(suc(x, y) (y)))] defines (A \ {, b}) ((b) b(b) ) Adding conjuncts min(x) (x) nd mx(x) b(x) to the previous sentence defines (b) x y[(min(x) (x)) (mx(x) b(x)) Suc(x, y) (b(x) b(y)) ((x) (y))] defines: Over the lphbet {,b}, the lnguge (b) Over the lphbet {,b,c}, the lnguge c (c bc )
10 Formuls define pointed lnguges Let A be {,b,c}; truth checking procedure is outlined below: 1. We hve uv = (x) 2. Since u,v re rbitrry, the formul (x) defines the pointed lnguge A A 3. Similrly uv(b c)w = α(x, y) def = x < y (y) 4. So y α(x, y) defines A (b c) 5. Agin tubvcw = β(x, y, z) def = x < y < z b(y) 6. So y β(x, y, z) defines A b ca 7. Hence z(c(z) y β(x, y, z))) defines A b ca 8. Since b c is included in (b c) (nd not conversely), the intersection A b c(b c) = A (b c) A (b ca ) of 4 nd 7 is definble in Σ 2 [<] by x((x) y(x < y (y)) z(c(z) y(x < y < z b(y))))
11 FO 2 logic to prtilly ordered two-wy utomt Theorem (Schwentick-Thérien-Vollmer 2002) Given n FO 2 sentence (formul), the (pointed) lnguge defined by it is ccepted by finite prtilly ordered two-wy utomton. Proof. For FO 2 formuls with free vribles V 1, we construct n utomton over the lphbet A (V 1 ): for (x), we hve n edge; for φ we exchnge finl nd non-finl sttes; for φ ψ we hve product construction. All done using prtilly ordered one-wy utomt. There re only two vribles, so one cn hve y > x((y) φ) or y < x((y) φ). These determine instructions to go forwrd nd/or bckwrd on the word looking for letters of the lphbet on self-loop. Finding the position y one flls down the prtil order. This cn be done by prtilly ordered two-wy utomt. Boolen opertions now done by stisfying ech formul in sequence.
12 FO logic to counter-free utomt Theorem (Schützenberger 1966, McNughton-Ppert 1971) Given n FO sentence (formul), the (pointed) lnguge defined by it is ccepted by finite counter-free utomton. Proof. By induction on FO formuls with free vribles V 1, we construct counter-free utomton over the pointers lphbet A (V 1 ): for (x), x = y nd x < y we directly construct the utomt; for φ ψ we hve product construction; for φ we ssume deterministic utomton nd exchnge finl nd non-finl sttes; for xφ we project the utomton to the lphbet A (V 1 \ {x}) by nondeterministiclly guessing the position interpreting x. Corollry {w w 0 mod q, q 2} nd () re not FO-definble. Becuse their syntctic monoids contin subgroups Z q nd Z 3.
13 More logics on words MSO ::= (FO nd ) x Y Yφ, x, y Vr 1, Y Vr 2 FO ::= (x) x = y Suc(x, y) x < y φ φ ψ xφ, x, y Vr 1 The MSO sentence O E x[(x) (min(x) x O) (mx(x) x E) y((x O Suc(x, y) y E) (x E Suc(x, y) y O))] defines the lnguge () which is not FO-definble An FO sentence is Σ r [<]/Π r [<] if it hs r lternting blocks of quntifiers, with first block existentil/universl r [<] is the clss of lnguges which re definble by both Σ r [<] nd Π r [<] sentences (Σ r [<] Π r [<] lnguges) An MSO sentence is MQ 1 s -q0 r if it hs s lternting blocks of set quntifiers, followed by r lternting blocks of first-order quntifiers (sentence bove is MΣ 1 1 -Π0 1 [<])
14 MSO logic to finite utomt Theorem (Büchi 1960, Elgot 1961, Trkhtenbrot 1962) Given n MSO sentence (formul), the (pointed) lnguge defined by it is ccepted by finite utomton. Proof. Extending the proof for FO formuls, with free first-order vribles V 1 nd free set vribles V 2, we construct n utomton over the extended pointers lphbet A (V 1 ) (V 2 ): for the tomic formul x Y, we hve direct construction nd for the set quntifier Y φ we gin do projection by nondeterministiclly guessing the positions which re lbelled Y. As there cn be mny such positions lbelled Y, there is no gurntee tht the construction is counter-free. For the even-length words MSO sentence, nontrivil cycle is introduced round n E-stte (nd n O-stte).
15 The utomt-logic connection (Büchi-Elgot-Trkhtenbrot) Theorem Given finite utomton, the lnguge ccepted by it is defined by n MΣ 1 1 -Π0 [<] sentence. 1 X Y Z stte positions [ x y(x X Suc(x, y) y Y) y z(y Y Suc(y, z) ((b(y) z X) ((y) z Z))) z x(z Z Suc(z, x),b X Y b Z b ((b(z) x Z) ((z) x X))) y z(y Y Suc(y, z) b(y)) goes to finl stte X z x(z Z Suc(z, x) (z)) goes to finl stte X x((x(x) Y(x) Z(x)) ((x) b(x))) unique stte/letter ] By closure under complement, on finite words MSO = M 1 1.
16 Strfree expressions Strfree expressions e ::= A e 1 e 2 e 1 e 2 e 1 Strfree expressions re defined s, { A}, corresponding to the empty nd singleton lnguges, nd tking the closure under the opertions e 1 e 2 (conctention), e 1 e 2 (union) nd e 1 (complement). (Avoiding the empty word.) Regulr expressions e ::= A e 1 e 2 e 1 e 2 e + 1 The regulr expressions re obtined by closing the strfree expressions under the opertion str (itertion of conctention). Here we use plus. The corresponding lnguge is {w 1... w n w i L(e 1 ), 1 i n}. Theorem (Kleene 1956) Regulr expressions define exctly the lnguges ccepted by finite utomt.
17 Dot-depth hierrchy (Brzozowksi-Knst-Thoms) Strfree expressions e ::= A e 1 e 2 e 1 e 2 e 1 The empty lnguge nd its complement (which is A + ) re dot-depth 0 expressions Closing dot-depth r expressions under conctention nd then boolen opertions gives dot-depth r + 1 expressions Theorem (McNughton-Ppert 1971) The dot-depth r lnguges re B r [<, min, mx, Suc]-definble. Hence the strfree lnguges re FO-definble. flse, (min = mx) (min) e 1 e 2 x(e [min,x] 1 e [Suc(x),mx] 2 ). Here n FO sentence is reltivized to n intervl, e.g. (x) [i,j] = i x j (x) nd ( xφ(x)) [i,j] = x(i x j (φ(x) [i,j] )) The positions min nd mx t the beginning nd end of word, the successor function Suc(x) cn be defined in FO
18 Dot-depth hierrchy (Brzozowksi-Knst-Thoms) Suppose the lphbet A hs t lest two letters. Theorem (Brzozowski-Knst 1978) The dot-depth hierrchy is infinite: B 0 [<] B 1 [<] B 2 [<]... Let Cycle r be the lnguge of W ll words w hving n equl X Y number of s nd b s, such tht b b for ll prefixes v of w, the number of b s is t most the num- b ber of s, the number of s is greter thn the number of b s Z,b by t most r. Automton for Cycle 2 There is B r+1 [<]-sentence defining the lnguge Cycle r. There is no B r [<]-sentence which defines Cycle r.
19 Algebr-expression connection for FO(Schützenberger) Theorem (Schützenberger 1965) The lnguge recognized by finite group-free monoid is strfree. Hence counter-free utomt cn only ccept strfree lnguges. The two-sided idels MmM = {nmp n, p M} in the finite monoid M (with h : A M), re prtilly ordered by inclusion The bsence of nontrivil subgroup mens tht the intersection of right idel mm = {mp p M} nd left idel Mm = {nm n M} of the monoid M is t most singleton Using this one cn build strfree expression for the inverse h 1 (m) of every singleton by n induction on the idel order For the utomton for the lnguge (b b) not obviously strfree Schützenberger s proof yields the strfree expression (A b(b) A ) (A b (b) ba ), where the lnguge (b) is described by the expression A A b A ( bb)a
20 Algebr-logic connection for FO 2 Theorem (Schütz.1976, Schwentick-Thérien-Vollmer 2002) The lnguge recognized by finite monoid in DA is unmbiguous strfree. Hence prtilly ordered two-wy utomt cn only ccept unmbiguous lnguges, which re definble in FO 2. The left nd right idels Mm, mm in the finite monoid with h : A M, re prtilly ordered by inclusion A word u cn be fctorized u t u t where ech u i stys in n R-clss, nd ech i moves to new R-clss for i u i Ech u i mps to n idempotent nd ech i+1 tkes one to the next D-clss, i+1 hs to use letter not in u i A word v = v t v t, where every pir h(u i ) = h(v i ) mps to the sme element, must mp to the sme h(u) = h(v) A symmetric result holds for right-to-left fctoriztions, giving n unmbiguous expression A t A t, A i A Boolen combintion of expressions cn be written in FO 2
Theory 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 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 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 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 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 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 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 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 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 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 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 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 informationSpeech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research
Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Mehryr Mohri Cournt Institute nd Google Reserch mohri@cims.nyu.com Preliminries Finite lphet Σ, empty string. Set of ll strings over
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 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 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 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 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 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 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 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 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. 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 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 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 informationA tutorial on sequential functions
A tutoril on sequentil functions Jen-Éric Pin LIAFA, CNRS nd University Pris 7 30 Jnury 2006, CWI, Amsterdm Outline (1) Sequentil functions (2) A chrcteriztion of sequentil trnsducers (3) Miniml sequentil
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 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 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 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 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 informationAutomata 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 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 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 informationSpeech 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 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 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 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 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 informationC. C^mpenu, K. Slom, S. Yu upper boun of mn. So our result is tight only for incomplete DF's. For restricte vlues of m n n we present exmples of DF's
Journl of utomt, Lnguges n Combintorics u (v) w, x{y c OttovonGuerickeUniversitt Mgeburg Tight lower boun for the stte complexity of shue of regulr lnguges Cezr C^mpenu, Ki Slom Computing n 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 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 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 informationLecture 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 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 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 informationFORMAL LANGAUGES & AUTOMATA
FORMAL LANGAUGES & AUTOMATA VICKY G We re going to study the reltionship between specil kind of mchine (utomt), lnguges nd specil kind of lgebr (monoids). Automt Regulr Lnguges Monoids 1. Monoids nd Lnguges
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 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 informationCOMPUTER SCIENCE TRIPOS
CST.2011.2.1 COMPUTER SCIENCE TRIPOS Prt IA Tuesdy 7 June 2011 1.30 to 4.30 COMPUTER SCIENCE Pper 2 Answer one question from ech of Sections A, B nd C, nd two questions from Section D. Submit the nswers
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 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 informationThis lecture covers Chapter 8 of HMU: Properties of CFLs
This lecture covers Chpter 8 of HMU: Properties of CFLs Turing Mchine Extensions of Turing Mchines Restrictions of Turing Mchines Additionl Reding: Chpter 8 of HMU. Turing Mchine: Informl Definition B
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 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 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 informationFor convenience, we rewrite m2 s m2 = m m m ; where m is repeted m times. Since xyz = m m m nd jxyj»m, we hve tht the string y is substring of the fir
CSCI 2400 Models of Computtion, Section 3 Solutions to Homework 4 Problem 1. ll the solutions below refer to the Pumping Lemm of Theorem 4.8, pge 119. () L = f n b l k : k n + lg Let's ssume for contrdiction
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 informationMATH 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 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 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 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 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 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 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 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 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 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 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 informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationA negative answer to a question of Wilke on varieties of!-languages
A negtive nswer to question of Wilke on vrieties of!-lnguges Jen-Eric Pin () Astrct. In recent pper, Wilke sked whether the oolen comintions of!-lnguges of the form! L, for L in given +-vriety of lnguges,
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 informationKleene Theorems for Free Choice Nets Labelled with Distributed Alphabets
Kleene Theorems for Free Choice Nets Lbelled with Distributed Alphbets Rmchndr Phwde Indin Institute of Technology Dhrwd, Dhrwd 580011, Indi Emil: prb@iitdh.c.in Abstrct. We provided [15] expressions for
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.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
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 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 informationBoolean Algebra. Boolean Algebras
Boolen Algebr Boolen Algebrs A Boolen lgebr is set B of vlues together with: - two binry opertions, commonly denoted by + nd, - unry opertion, usully denoted by or ~ or, - two elements usully clled zero
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 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 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 informationLTL Translation Improvements in Spot
LTL Trnsltion Improvements in Spot Alexndre Duret-Lutz http://www.lrde.epit.fr/~dl/ VECoS'11 16 September 2011 Alexndre Duret-Lutz LTL Trnsltion Improvements 1 / 19 Context High-level
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 informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationTREE AUTOMATA AND TREE GRAMMARS
TREE AUTOMATA AND TREE GRAMMARS rxiv:1510.02036v1 [cs.fl] 7 Oct 2015 by Joost Engelfriet DAIMI FN-10 April 1975 Institute of Mthemtics, University of Arhus DEPARTMENT OF COMPUTER SCIENCE Ny Munkegde, 8000
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
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 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 informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
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 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 informationStreamed Validation of XML Documents
Preliminries DTD Document Type Definition References Jnury 29, 2009 Preliminries DTD Document Type Definition References Structure Preliminries Unrnked Trees Recognizble Lnguges DTD Document Type Definition
More informationPART 2. REGULAR LANGUAGES, GRAMMARS AND AUTOMATA
PART 2. REGULAR LANGUAGES, GRAMMARS AND AUTOMATA RIGHT LINEAR LANGUAGES. Right Liner Grmmr: Rules of the form: A α B, A α A,B V N, α V T + Left Liner Grmmr: Rules of the form: A Bα, A α A,B V N, α V T
More informationResults on Planar Near Rings
Interntionl Mthemticl Forum, Vol. 9, 2014, no. 23, 1139-1147 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/imf.2014.4593 Results on Plnr Ner Rings Edurd Domi Deprtment of Mthemtics, University
More informationAutomata and semigroups recognizing infinite words
Automt nd semigroups recognizing infinite words Olivier Crton 1 Dominique Perrin 2 Jen-Éric Pin1 1 LIAFA, CNRS nd Université Denis Diderot Pris 7, Cse 7014, 75205 Pris Cedex 13, Frnce 2 Institut Gsprd
More informationClosure Properties of Regular Languages
of Regulr Lnguges Dr. Neil T. Dntm CSCI-561, Colordo School of Mines Fll 2018 Dntm (Mines CSCI-561) Closure Properties of Regulr Lnguges Fll 2018 1 / 50 Outline Introduction Closure Properties Stte Minimiztion
More informationTHEOTY OF COMPUTATION
Pushdown utomt nd Prsing lgorithms: Pushdown utomt nd context-free lnguges; Deterministic PDNondeterministic PD- Equivlence of PD nd CFG-closure properties of CFL. PUSHDOWN UTOMT ppliction: Regulr lnguges
More informationNondeterministic 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 informationAutomata, Games, and Verification
Automt, Gmes, nd Verifiction Prof. Bernd Finkbeiner, Ph.D. Srlnd University Summer Term 2015 Lecture Notes by Bernd Finkbeiner, Felix Klein, Tobis Slzmnn These lecture notes re working document nd my contin
More information