One Minute To Learn Programming: Finite Automata


 Beatrice Blankenship
 1 years ago
 Views:
Transcription
1 Gret Theoreticl Ides In Computer Science Steven Rudich CS Spring 2005 Lecture 9 Fe Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt
2 Let me tech you progrmming lnguge so simple tht you cn lern it in less thn minute.
3 Meet ABA The Automton! Input String ε Result Accept Reject Accept Accept
4 The Simplest Interesting Mchine: Finite Stte Mchine OR Finite Automton
5 Finite Automton Finite set of sttes o 1 2 A strt stte Q = { q, q, q,, q } q o k A set of ccepting sttes A finite lphet Stte trnsition instructions # qi x 1 q j { } i i i F = q, q,, q 1 2 r : Q ( q, ) = i Σ q j Q
6 How Mchine M opertes. M reds one letter t time from the input string (going from left to right) M strts in stte q 0. If M is in stte q i reds the letter then If δ(q i. ) is undefined then CRASH. Otherwise M moves to stte δ(q i,)
7 Let M=(Q,S,F,d) e finite utomton. M ccepts the string x if when M reds x it ends in n ccepting stte. M rejects the string x if when M reds x it ends in nonccepting stte. M crshes on x if M crshes while reding x.
8 The set (or lnguge) ccepted y M is: M { * } L = x M ccepts x k All length k strings over the lphet * Notice tht this is {ε}
9 Wht is the lnguge ccepted y this mchine?, L = {,}* = ll finite strings of s nd s
10 Wht is the lnguge ccepted y this mchine?,, L = ll even length strings of s nd s
11 Wht mchine ccepts this lnguge? L = ll strings in {,}* tht contin t lest one,
12 Wht mchine ccepts this lnguge? L = strings with n odd numer of s nd ny numer of s
13 Wht is the lnguge ccepted y this mchine? L = ny string ending with
14 Wht is the lnguge ccepted y this mchine?, L = ny string with t lest two s
15 Wht mchine ccepts this lnguge? L = ny string with n nd,
16 Wht mchine ccepts this lnguge? L = strings with n even numer of pirs
17 L = ll strings contining s consecutive sustring, ε Invrint: I m stte s exctly when s is the longest suffix of the input (so fr) tht forms prefix of.
18 The grep Prolem Input: text T of length t string S of length n Nïve method: Prolem: Does the string S pper inside the text T? n symols,,,, t Cost: O(nt) comprisons
19 Automt Solution Build mchine M tht ccepts ny string with S s consecutive sustring. Feed the text to M. Cost: t comprisons + time to uild M. As luck would hve it, the Knuth, Morris, Prtt lgorithm uilds M quickly. By the wy, it cn e done with fewer thn t comprisons in the worst cse!
20 Rellife uses of finite stte mchines grep coke mchines thermostts (fridge) elevtors trin trck switches lexicl nlyzers for prsers
21 Any L Σ is defined to e lnguge. L is just set of strings. It is clled lnguge for historicl resons.
22 Let L Σ e lnguge. L is clled regulr lnguge if there is some finite utomton tht ccepts L. In this lecture we hve seen mny regulr lnguges. Σ even length strings strings contining
23 Theorem: Any finite lngge is regulr. Proof: Mke mchine with pth for ech string in the lnguge. Exmple: L = {, cd, c, } c c d
24 Are ll lnguges regulr?
25 Consider the lnguge n n = { ε,,,, } i.e., unch of s followed y n equl numer of s No finite utomton ccepts this lnguge. Cn you prove this?
26 n n is not regulr. No mchine hs enough sttes to keep trck of the numer of s it might encounter.
27 Tht is firly wek rgument. Consider the following exmple
28 L = strings where the # of occurrences of the pttern is equl to the numer of occurrences of the pttern Cn t e regulr. No mchine hs enough sttes to keep trck of the numer of occurrences of.
29 Rememer ABA? ABA ccepts only the strings with n equl numer of s nd s!
30 Let me show you professionl strength proof tht n n is not regulr.
31 Professionl Strength Proof Theorem: n n is not regulr. Proof: Assume tht it is. Then M with k sttes tht ccepts it. For ech 0 i k, let S i e the stte M is in fter reding i. i,j k s.t. S i = S j, ut i j M will do the sme thing on i i nd j i. But vlid M must reject j i nd ccept i i.
32 MORAL: Finite utomt cn t count.
33 Advertisement You cn lern much more out these cretures in the FLAC course. Forml Lnguges, Automt, nd Computtion There is unique smllest utomton for ny regulr lnguge It cn e found y fst lgorithm.
34 Cellulr Automt Line up unch of identicl finite utomt in stright line. qi q k q j Trnsitions re sed on the sttes of the mchine s two neighors or n indictor tht neighor is missing. (There is no other input.) Q Q Q Q ( q, q, q ) k i j l = q qk q, q i j ql All cells move to their Steven next Rudich: sttes t the sme time: synchronous trnsition
35 The Firing Squd Prolem Five soldiers ll strt in the stte. You chnge the one on the left to the wke stte. All five must get to the fire stte t the sme time (for the first time). wke fire wke fire wke fire wke fire wke fire wke fire wke fire wke fire wke fire wke fire
36 Shorthnd { d} Q,,, Mens use this trnsition when your left neighor is in ny stte t ll nd your right neighor is in stte,, or d.
37 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire!
38 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire! wke
39 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire! wke wke2 wke2
40 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire! wke wke2 wke2 wke3 wke3 wke3
41 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire! wke wke2 wke2 wke3 wke3 wke3 wke4 wke4 wke4 wke4
42 {,fire,end},q {w},q {w2},q {w3},q {w4},q wke wke2 wke3 wke4 Q,Q Q,Q Q,Q Q,Q fire! wke wke2 wke2 wke3 wke3 wke3 wke4 wke4 wke4 wke4 fire fire fire fire fire
43 Question Cn you uild the soldier s finite utomton rin efore you know how mny soldiers will e in the line? No. Finite utomt cn t count!
44 Don t jump to conclusions! It is possile to design single cellulr utomton tht works for ny numer of soldiers!
Formal Languages and Automata Exam
Forml Lnguges nd Automt Exm Fculty of Computers & Informtion Deprtment: Computer Science Grde: Third Course code: CSC 34 Totl Mrk: 8 Dte: 23//2 Time: 3 hours Answer the following questions: ) Consider
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 informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 25 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 25 September 2015 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationIn the following there are presented four different kinds of simulation games for a given Büchi automaton A = :
Simultion Gmes Motivtion There re t lest two distinct purposes for which it is useful to compute simultion reltionships etween the sttes of utomt. Firstly, with the use of simultion reltions it is possile
More informationflex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A
flex Regulr Expressions nd Lexicl Scnning Using flex to Build Scnner flex genertes lexicl scnners: progrms tht discover tokens. Tokens re the smllest meningful units of progrm (or other string). flex is
More informationSuffix Trees CMSC 423
Suffix Trees CMSC 423 Preprocessing Strings Over the next few lectures, we ll see severl methods for preprocessing string dt into dt structures tht mke mny questions (like serching) esy to nswer: Suffix
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationFORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES
FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion
More informationSquare Roots Teacher Notes
Henri Picciotto Squre Roots Techer Notes This unit is intended to help students develop n understnding of squre roots from visul / geometric point of view, nd lso to develop their numer sense round this
More informationRegular Languages and Finite Automata
N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse rel number to its binry representtion,. convert binry number to n equivlent bse number. In everydy
More informationBinary Golomb Codes. CSE 589 Applied Algorithms Autumn Constructing a Binary Golomb Code. Example. Example. Comparison of GC with Entropy
CSE 589 pplied lgorithms utumn Golom Coding rithmetic Coding LZW Sequitur Binry Golom Codes Binry source with s much more frequent thn s. Vriletovrile length code Prefix code. Golom code of order 4 input
More informationExponentiation: Theorems, Proofs, Problems Pre/Calculus 11, Veritas Prep.
Exponentition: Theorems, Proofs, Problems Pre/Clculus, Verits Prep. Our Exponentition Theorems Theorem A: n+m = n m Theorem B: ( n ) m = nm Theorem C: (b) n = n b n ( ) n n Theorem D: = b b n Theorem E:
More informationAssuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;
B26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndomnumer genertor supplied s stndrd with ll computer systems Stn KellyBootle,
More informationExample 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.
2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this
More informationSolving the String Statistics Problem in Time O(n log n)
Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl 1,,, Rune B. Lyngsø 3, Ann Östlin1,, nd Christin N. S. Pedersen 1,2, 1 BRICS, Deprtment of Computer Science, University of Arhus,
More informationHere I am. Modeling and Verification of Real Time and Embedded Systems. TIMES: UPPAAL: Main Goal of the tutorial
Here I m Uppsl (university city) Stockholm Modeling nd Verifiction of Rel Time nd Emedded Systems A tutoril on UPPAAL Wng Yi Uppsl University, Sweden, 2005 UPPAAL: www.uppl.com A model checker for rel
More informationVariable Dry Run (for Python)
Vrile Dr Run (for Pthon) Age group: Ailities ssumed: Time: Size of group: Focus Vriles Assignment Sequencing Progrmming 7 dult Ver simple progrmming, sic understnding of ssignment nd vriles 2050 minutes
More informationChapter 9: Quadratic Equations
Chpter 9: Qudrtic Equtions QUADRATIC EQUATIONS DEFINITION + + c = 0,, c re constnts (generlly integers) ROOTS Synonyms: Solutions or Zeros Cn hve 0, 1, or rel roots Consider the grph of qudrtic equtions.
More informationLecture 15  Curve Fitting Techniques
Lecture 15  Curve Fitting Techniques Topics curve fitting motivtion liner regression Curve fitting  motivtion For root finding, we used given function to identify where it crossed zero where does fx
More informationUnambiguous Recognizable Twodimensional Languages
Unmbiguous Recognizble Twodimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC
More informationBasic technologies. Lexical analysis. Lexical analysis. Basic technologies. Syntactical analysis Parser generators Rewrite engines
Bsc technologes Generc Lnguge Technology: Bsc technologes Pro.dr. Mrk vn den Brnd Syntctcl nlyss Prser genertors Rewrte engnes / Fcultet Wskunde en Inormtc 292010 PAGE 1 Tsks nd orgnzton o lexcl nlyzer
More informationA Visual and Interactive Input abb Automata. Theory Course with JFLAP 4.0
Strt Puse Step Noninverted Tree A Visul nd Interctive Input Automt String ccepted! 5 nodes generted. Theory Course with JFLAP 4.0 q0 even 's, even 's q2 even 's, odd 's q1 odd 's, even 's q3 odd 's, odd
More informationLesson 10. Parametric Curves
Return to List of Lessons Lesson 10. Prmetric Curves (A) Prmetric Curves If curve fils the Verticl Line Test, it cn t be expressed by function. In this cse you will encounter problem if you try to find
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationEquations between labeled directed graphs
Equtions etween leled directed grphs Existence of solutions GrretFontelles A., Misnikov A., Ventur E. My 2013 Motivtionl prolem H 1 nd H 2 two sugroups of the free group generted y X A, F (X, A). H 1
More informationnot to be republished NCERT POLYNOMIALS CHAPTER 2 (A) Main Concepts and Results (B) Multiple Choice Questions
POLYNOMIALS (A) Min Concepts nd Results Geometricl mening of zeroes of polynomil: The zeroes of polynomil p(x) re precisely the xcoordintes of the points where the grph of y = p(x) intersects the xxis.
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More informationGenerating InLine Monitors For Rabin Automata
Generting InLine Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon AdrienPouliot, 1065, venue de l Medecine Queec
More informationLiveEngage Agent Guide. Version 1.0
Agent Guide Version 1.0 Tle of Contents Contents LOGGING IN... 3 NAVIGATING LIVEENGAGE... 4 Visitor List, Connection Are, Enggement Br & Going Online... 4 ENGAGEMENT OPTIONS... 5 Tking n Enggment... 5
More information3 Determinization of BüchiAutomata
3 Determiniztion of BüchiAutomt Mrkus Roggenbch Bremen Institute for Sfe Systems Bremen University For Bene Introduction To determinize Büchi utomt it is necessry to switch to nother clss of ωutomt,
More informationAutomated Grading of DFA Constructions
Automted Grding of DFA Constructions Rjeev Alur nd Loris D Antoni Sumit Gulwni Dileep Kini nd Mhesh Viswnthn Deprtment of Computer Science Microsoft Reserch Deprtment of Computer Science University of
More informationLecture 3 Basic Probability and Statistics
Lecture 3 Bsic Probbility nd Sttistics The im of this lecture is to provide n extremely speedy introduction to the probbility nd sttistics which will be needed for the rest of this lecture course. The
More informationHow fast can we sort? Sorting. Decisiontree model. Decisiontree for insertion sort Sort a 1, a 2, a 3. CS 3343  Spring 2009
CS 4  Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison
More informationBasic Math Review. Numbers. Important Properties. Absolute Value PROPERTIES OF ADDITION NATURAL NUMBERS {1, 2, 3, 4, 5, }
ƒ Bsic Mth Review Numers NATURAL NUMBERS {1,, 3, 4, 5, } WHOLE NUMBERS {0, 1,, 3, 4, } INTEGERS {, 3,, 1, 0, 1,, } The Numer Line 5 4 3 1 0 1 3 4 5 Negtive integers Positive integers RATIONAL NUMBERS All
More informationModular Generic Verification of LTL Properties for Aspects
Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationThe AVL Tree Rotations Tutorial
The AVL Tree Rottions Tutoril By John Hrgrove Version 1.0.1, Updted Mr222007 Astrt I wrote this doument in n effort to over wht I onsider to e drk re of the AVL Tree onept. When presented with the tsk
More informationRational Functions. Rational functions are the ratio of two polynomial functions. Qx bx b x bx b. x x x. ( x) ( ) ( ) ( ) and
Rtionl Functions Rtionl unctions re the rtio o two polynomil unctions. They cn be written in expnded orm s ( ( P x x + x + + x+ Qx bx b x bx b n n 1 n n 1 1 0 m m 1 m + m 1 + + m + 0 Exmples o rtionl unctions
More information2 DIODE CLIPPING and CLAMPING CIRCUITS
2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of
More informationLines and Angles. 2. Straight line is a continuous set of points going on forever in both directions:
Lines nd Angles 1. Point shows position. A 2. Stright line is continuous set of points going on forever in oth directions: 3. Ry is line with one endpoint. The other goes on forever. G 4. Line segment
More informationBasic Research in Computer Science BRICS RS0213 Brodal et al.: Solving the String Statistics Problem in Time O(n log n)
BRICS Bsic Reserch in Computer Science BRICS RS0213 Brodl et l.: Solving the String Sttistics Prolem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl Rune
More informationGeometry 71 Geometric Mean and the Pythagorean Theorem
Geometry 71 Geometric Men nd the Pythgoren Theorem. Geometric Men 1. Def: The geometric men etween two positive numers nd is the positive numer x where: = x. x Ex 1: Find the geometric men etween the
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More information4 Geometry: Shapes. 4.1 Circumference and area of a circle. FM Functional Maths AU (AO2) Assessing Understanding PS (AO3) Problem Solving HOMEWORK 4A
Geometry: Shpes. Circumference nd re of circle HOMEWORK D C 3 5 6 7 8 9 0 3 U Find the circumference of ech of the following circles, round off your nswers to dp. Dimeter 3 cm Rdius c Rdius 8 m d Dimeter
More informationAe2 Mathematics : Fourier Series
Ae Mthemtics : Fourier Series J. D. Gibbon (Professor J. D Gibbon, Dept of Mthemtics j.d.gibbon@ic.c.uk http://www.imperil.c.uk/ jdg These notes re not identicl wordforword with my lectures which will
More informationState the size of angle x. Sometimes the fact that the angle sum of a triangle is 180 and other angle facts are needed. b y 127
ngles 2 CHTER 2.1 Tringles Drw tringle on pper nd lel its ngles, nd. Ter off its orners. Fit ngles, nd together. They mke stright line. This shows tht the ngles in this tringle dd up to 180 ut it is not
More informationProtocol Analysis. 17654/17764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17654/17764 Anlysis of Softwre Artifcts Kevin Bierhoff TkeAwys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More informationGeneralized Inverses: How to Invert a NonInvertible Matrix
Generlized Inverses: How to Invert NonInvertible Mtrix S. Swyer September 7, 2006 rev August 6, 2008. Introduction nd Definition. Let A be generl m n mtrix. Then nturl question is when we cn solve Ax
More informationAngles 2.1. Exercise 2.1... Find the size of the lettered angles. Give reasons for your answers. a) b) c) Example
2.1 Angles Reognise lternte n orresponing ngles Key wors prllel lternte orresponing vertilly opposite Rememer, prllel lines re stright lines whih never meet or ross. The rrows show tht the lines re prllel
More informationSection 54 Trigonometric Functions
5 Trigonometric Functions Section 5 Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationBayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prsergenertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationAPPLICATION NOTE Revision 3.0 MTD/PS0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS
APPLICATION NOTE Revision 3.0 MTD/PS0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS TABLE OF FIGURES Figure 1: Spectrl Response of CMOS Imge Sensor...3 Figure 2: Byer CFA Ptterns...4
More informationSolutions to Section 1
Solutions to Section Exercise. Show tht nd. This follows from the fct tht mx{, } nd mx{, } Exercise. Show tht = { if 0 if < 0 Tht is, the bsolute vlue function is piecewise defined function. Grph this
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments  they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationKnow the sum of angles at a point, on a straight line and in a triangle
2.1 ngle sums Know the sum of ngles t point, on stright line n in tringle Key wors ngle egree ngle sum n ngle is mesure of turn. ngles re usully mesure in egrees, or for short. ngles tht meet t point mke
More informationDlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report
DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of
More informationAnnouncements. CS 188: Artificial Intelligence. Example: Weather HMM. Filtering / Monitoring. Hidden Markov Models   Filters
Announcements P4 Byes Nets / Tresure Hunting hs een relesed. It s due Mondy April 4th t :59pm. HW7 hs een relesed. It s due Tuesdy April 5th, t :59pm. It s out twice s long s typicl homework. We encourge
More informationand thus, they are similar. If k = 3 then the Jordan form of both matrices is
Homework ssignment 11 Section 7. pp. 24925 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If
More informationWell say we were dealing with a weak acid K a = 1x10, and had a formal concentration of.1m. What is the % dissociation of the acid?
Chpter 9 Buffers Problems 2, 5, 7, 8, 9, 12, 15, 17,19 A Buffer is solution tht resists chnges in ph when cids or bses re dded or when the solution is diluted. Buffers re importnt in Biochemistry becuse
More informationSection A4 Rational Expressions: Basic Operations
A Appendi A A BASIC ALGEBRA REVIEW 7. Construction. A rectngulr opentopped bo is to be constructed out of 9 by 6inch sheets of thin crdbord by cutting inch squres out of ech corner nd bending the
More informationThe area of the larger square is: IF it s a right triangle, THEN + =
8.1 Pythgoren Theorem nd 2D Applitions The Pythgoren Theorem sttes tht IF tringle is right tringle, THEN the sum of the squres of the lengths of the legs equls the squre of the hypotenuse lengths. Tht
More informationBrillouin Zones. Physics 3P41 Chris Wiebe
Brillouin Zones Physics 3P41 Chris Wiebe Direct spce to reciprocl spce * = 2 i j πδ ij Rel (direct) spce Reciprocl spce Note: The rel spce nd reciprocl spce vectors re not necessrily in the sme direction
More informationSolutions for Selected Exercises from Introduction to Compiler Design
Solutions for Selected Exercises from Introduction to Compiler Design Torben Æ. Mogensen Lst updte: My 30, 2011 1 Introduction This document provides solutions for selected exercises from Introduction
More informationTreatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.
The nlysis of vrince (ANOVA) Although the ttest is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the ttest cn be used to compre the mens of only
More informationUnit 6: Exponents and Radicals
Eponents nd Rdicls : The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N):  counting numers. {,,,,, } Whole Numers (W):  counting numers with 0. {0,,,,,, } Integers (I): 
More informationLinear Equations in Two Variables
Liner Equtions in Two Vribles In this chpter, we ll use the geometry of lines to help us solve equtions. Liner equtions in two vribles If, b, ndr re rel numbers (nd if nd b re not both equl to 0) then
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More information! What can a computer do? ! What can a computer do with limited resources? ! Don't talk about specific machines or problems.
Introduction to Theoreticl CS ecture 18: Theory of Computtion Two fundmentl questions.! Wht cn computer do?! Wht cn computer do with limited resources? Generl pproch. Pentium IV running inux kernel.4.!
More informationComplementary Coffee Cups
Complementry Coffee Cups Thoms Bnchoff Tom Bnchoff (Thoms Bnchoff@brown.edu) received his B.A. from Notre Dme nd his Ph.D. from the University of Cliforni, Berkeley. He hs been teching t Brown University
More informationLec 2: Gates and Logic
Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on wepge Use it for prtner finding First ssignment is to find prtners Due this
More informationA Note on Complement of Trapezoidal Fuzzy Numbers Using the αcut Method
Interntionl Journl of Applictions of Fuzzy Sets nd Artificil Intelligence ISSN  Vol.  A Note on Complement of Trpezoidl Fuzzy Numers Using the αcut Method D. Stephen Dingr K. Jivgn PG nd Reserch Deprtment
More information1. 1 m/s m/s m/s. 5. None of these m/s m/s m/s m/s correct m/s
Crete ssignment, 99552, Homework 5, Sep 15 t 10:11 m 1 This printout should he 30 questions. Multiplechoice questions my continue on the next column or pge find ll choices before nswering. The due time
More informationDETERMINANTS. ] of order n, we can associate a number (real or complex) called determinant of the matrix A, written as det A, where a ij. = ad bc.
Chpter 4 DETERMINANTS 4 Overview To every squre mtrix A = [ ij ] of order n, we cn ssocite number (rel or complex) clled determinnt of the mtrix A, written s det A, where ij is the (i, j)th element of
More information11. Fourier series. sin mx cos nx dx = 0 for any m, n, sin 2 mx dx = π.
. Fourier series Summry of the bsic ides The following is quick summry of the introductory tretment of Fourier series in MATH. We consider function f with period π, tht is, stisfying f(x + π) = f(x) for
More informationStrong acids and bases
Monoprotic AcidBse Equiliri (CH ) ϒ Chpter monoprotic cids A monoprotic cid cn donte one proton. This chpter includes uffers; wy to fi the ph. ϒ Chpter 11 polyprotic cids A polyprotic cid cn donte multiple
More information4.0 5Minute Review: Rational Functions
mth 130 dy 4: working with limits 1 40 5Minute Review: Rtionl Functions DEFINITION A rtionl function 1 is function of the form y = r(x) = p(x) q(x), 1 Here the term rtionl mens rtio s in the rtio of two
More informationA.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324
A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................
More informationIntroduction to Mathematical Reasoning, Saylor 111
Frction versus rtionl number. Wht s the difference? It s not n esy question. In fct, the difference is somewht like the difference between set of words on one hnd nd sentence on the other. A symbol is
More informationWindows 7/8. Windows 7/8. Installation Guide Sawgrass SG400/SG800. v
Windows 7/8 Windows 7/8 Instlltion Guide Swgrss SG400/SG800 v20150521 Contents Virtuoso SG400/SG800 Initil Setup...2 Browser Instlltion...3 Internet Connection Speeds...3 CS Print nd Color Mnger Downlod...
More information4: RIEMANN SUMS, RIEMANN INTEGRALS, FUNDAMENTAL THEOREM OF CALCULUS
4: RIEMA SUMS, RIEMA ITEGRALS, FUDAMETAL THEOREM OF CALCULUS STEVE HEILMA Contents 1. Review 1 2. Riemnn Sums 2 3. Riemnn Integrl 3 4. Fundmentl Theorem of Clculus 7 5. Appendix: ottion 10 1. Review Theorem
More informationThe Math Learning Center PO Box 12929, Salem, Oregon 97309 0929 Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 1010Q Determine perimeter using concrete models, nonstndrd units, nd stndrd units. (QT M 146) Use models to develop formuls for finding res of tringles,
More informationexcenters and excircles
21 onurrene IIi 2 lesson 21 exenters nd exirles In the first lesson on onurrene, we sw tht the isetors of the interior ngles of tringle onur t the inenter. If you did the exerise in the lst lesson deling
More informationSTRINGS AND PATTERN MATCHING
STRINGS AND PATTERN MATCHING Brute Force, RinKrp, KnuthMorrisPrtt Wht s up? I m looking for some string. Tht s quite trick considering tht you hve no eyes. Oh yeh? Hve you seen your writing? It looks
More informationChapter. Contents: A Constructing decimal numbers
Chpter 9 Deimls Contents: A Construting deiml numers B Representing deiml numers C Deiml urreny D Using numer line E Ordering deimls F Rounding deiml numers G Converting deimls to frtions H Converting
More informationString Searching. String Search. Spam Filtering. String Search
String Serch String Serching String serch: given pttern string p, find first mtch in text t. Model : cn't fford to preprocess the text. KrpRin KnuthMorrisPrtt BoyerMoore N = # chrcters in text M =
More informationAutomata theory. An algorithmic approach. Lecture Notes. Javier Esparza
Automt theory An lgorithmic pproch 0 Lecture Notes Jvier Esprz My 3, 2016 2 3 Plese red this! Mny yers go I don t wnt to sy how mny, it s depressing I tught course on the utomttheoretic pproch to model
More informationAP QUIZ #2 GRAPHING MOTION 1) POSITION TIME GRAPHS DISPLACEMENT Each graph below shows the position of an object as a function of time.
AP QUIZ # GRAPHING MOTION ) POSITION TIME GRAPHS DISPLAEMENT Ech grph below shows the position of n object s function of time. A, B,, D, Rnk these grphs on the gretest mgnitude displcement during the time
More informationAngles. Angles. Curriculum Ready.
ngles ngles urriculum Redy www.mthletics.com ngles mesure the mount of turn in degrees etween two lines tht meet t point. Mny gmes re sed on interpreting using ngles such s pool, snooker illirds. lck
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More information